Invitation to Fixed-Parameter Algorithms by Rolf NiedermeierInvitation to Fixed-Parameter Algorithms by Rolf Niedermeier

Invitation to Fixed-Parameter Algorithms

byRolf Niedermeier

Hardcover | March 2, 2006

Pricing and Purchase Info

$195.84 online 
$252.00 list price save 22%
Earn 979 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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 parameterizedhardness 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.
Rolf Niedermeier is Chair of Theoretical Computer Science I / Computational Complexity at Universitaet Jena.
Title:Invitation to Fixed-Parameter AlgorithmsFormat:HardcoverDimensions:316 pages, 9.21 × 6.14 × 0.88 inPublished:March 2, 2006Publisher:Oxford University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0198566077

ISBN - 13:9780198566076


Table of Contents

Part I: Foundations1. Introduction to Fixed-Parameter Algorithms2. Preliminaries and Agreements3. Parameterized Complexity Theory - A Primer4. Vertex Cover - An Illustrative Example5. The Art of Problem Parameterization6. Summary and Concluding RemarksPart II: Algorithmic Methods7. Data Reduction and Problem Kernels8. Depth-Bounded Search Trees9. Dynamic Programming10. Tree Decompositions of Graphs11. Further Advanced Techniques12. Summary and Concluding RemarksPart III: Some Theory, Some Case Studies13. Parameterized Complexity Theory14. Connections to Approximation Algorithms15. Selected Case Studies16. ZukunftsmusikReferencesIndex