Invitation to Fixed Parameter Algorithms

Erscheinungsjahr 2006
ISBN: 978-0-19-856607-6
Verlag: OUP Oxford

Buch, Englisch, 312 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 640 g

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.

Zielgruppe

Graduate and research mathematicians, programmers, algorithm designers, and computer scientists

Autoren/Hrsg.

Niedermeier, Rolf

Fachgebiete

• Mathematik | Informatik Mathematik Mathematische Analysis Moderne Anwendungen der Analysis
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen

Inhaltsverzeichnis

- Part I: Foundations

- 1: Introduction to Fixed-Parameter Algorithms

- 2: Preliminaries and Agreements

- 3: Parameterized Complexity Theory - A Primer

- 4: Vertex Cover - An Illustrative Example

- 5: The Art of Problem Parameterization

- 6: Summary and Concluding Remarks

- Part II: Algorithmic Methods

- 7: Data Reduction and Problem Kernels

- 8: Depth-Bounded Search Trees

- 9: Dynamic Programming

- 10: Tree Decompositions of Graphs

- 11: Further Advanced Techniques

- 12: Summary and Concluding Remarks

- Part III: Some Theory, Some Case Studies

- 13: Parameterized Complexity Theory

- 14: Connections to Approximation Algorithms

- 15: Selected Case Studies

- 16: Zukunftsmusik

- References

- Index