Invitation to Fixed-Parameter Algorithms

Rolf Niedermeier - Collection Oxford Lecture Series in Mathematics and Its Applications

300 pages, parution le 02/02/2006

Ajouter à une liste

Indisponible

Résumé

This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.

The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology.

Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.

L'auteur - Rolf Niedermeier

Rolf Niedermeier, Universitaet Jena

Sommaire

Foundations
Algorithmic Methods
Some Theory, Some Case Studies
References
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Oxford University Press
Auteur(s)	Rolf Niedermeier
Collection	Oxford Lecture Series in Mathematics and Its Applications
Parution	02/02/2006
Nb. de pages	300
Format	16 x 24
Couverture	Relié
Poids	593g
Intérieur	Noir et Blanc
EAN13	9780198566076
ISBN13	978-0-19-856607-6