Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.
This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.
The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
Reviews / Votes
From the reviews:
"The book is comprehensive and up-to-date. . The definitions are illustrated by good examples, the proofs are complete and proceed at a convenient pace, the connections and the implications of the results are spelled out clearly, the exercises are relevant. The book is recommended to specialists as a work of reference, as well as to beginners who want a solid introduction to the theory of parametrized computational problems." (Marius Zimand, Zentralblatt MATH, Vol. 1143, 2008)
Series
Edition
Language
Place of publication
Publishing group
Target group
Professional and scholarly
Research
Illustrations
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 33 mm
Weight
ISBN-13
978-3-540-29952-3 (9783540299523)
DOI
Schweitzer Classification
Prof. Jörg Flum, Abteilung für Mathematische Logik, Albert-Ludwigs-Universität Freiburg, Germany, http://logik.mathematik.uni-freiburg.de/personen/Flum.html
Prof. Martin Grohe, Institut für Informatik, Humboldt-Universität zu Berlin, Germany, http://www.informatik.hu-berlin.de/~grohe/
The authors are very well qualified to write this book. In addition to their strong backgrounds in complexity, algorithms, etc., they have contributed a number of specific key results in parameterized complexity (e.g., http://epubs.siam.org/sam-bin/dbq/article/42720).
Jörg Flum has coauthored two other Springer monographs: (i) "Mathematical Logic", Undergraduate Texts in Mathematics, 0-387-94258-0, 3rd printing since 1994, over 4000 copies sold, Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas, http://www.springer.com/0-387-94258-0. (ii) "Finite Model Theory", Springer Monographs in Mathematics (was in series Perspectives in Mathematical Logic), printed in soft- and hardback, 1995, 2nd ed. in 1999, 2nd corr. print in 2006, Heinz-Dieter Ebbinghaus, Jörg Flum, 3-540-28787-6, http://www.springer.com/3-540-28787-6. In addition, Jörg Flum coauthored the following LNM title: Vol. 769, "Topological Model Theory, 1980, 3-540-09732-5, Jörg Flum, Martin Ziegler. And he coedited the following LNCS title: Vol. 1683, CSL 1999 conf. proc., Jörg Flum, Mario Rodriguez-Artalejo, 1999, 3-540-66536-6.
Prof. Martin Grohe has authored over 50 articles for refereed theoretical computer science journals and conference proceedings (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/g/Grohe:Martin.html) in the areas of logic, complexity, algorithms, etc.
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The W-Hierarchy.- The A-Hierarchy.- Kernelization and Linear Programming Techniques.- The Automata-Theoretic Approach.- Tree Width.- Planarity and Bounded Local Tree Width.- Homomorphisms and Embeddings.- Parameterized Counting Problems.- Bounded Fixed-Parameter Tractability and Limited Nondeterminism.- Subexponential Fixed-Parameter Tractability.
