Parameterized Algorithms
Description
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.
The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.
All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
Reviews / Votes
"I enjoyed reading this book, which is a good textbook for graduate and advanced undergraduate students of computer science. Each chapter contains sufficient exercises with hints whenever necessary and helpful bibliographic notes. I found the references quite comprehensive, and the index was quite useful. . this is the best book I have seen on the topic. I strongly recommend it." (Soubhik Chakraborty, Computing Reviews, April, 2017)
"The style of the book is clear, and the material is well positioned to be accessible by graduate students and advanced undergraduate students. The exercises and hints provide a good ground for self-study, while bibliographic notes point to original papers and related work. Overall, this is an excellent book that can be useful to graduate and advanced undergraduate students either as a self-study text or aspart of a course." (Alexander Tzanov, Computing Reviews, February, 2016)
"This is the most recent and most up-to-date textbook on parameterized algorithms, one of the major thrusts in algorithmics in recent years. . this new textbook has more than twice as many pages shows the development of the field. . This book does a very good job at balancing the necessary mathematical rigour with a nice presentation of the results." (Henning Fernau, Mathematical Reviews, February, 2016)
"This book serves as an introduction to the field of parameterized algorithms and complexity accessible to graduate students and advanced undergraduate students. It contains a clean and coherent account of some of the most recent tools and techniques in the area." (Paulo Mbunga, zbMATH 1334.90001, 2016)
More details
Other editions
Additional editions
Persons
Dr. Marek Cygan is an assistant professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include fixed parameter tractability, approximation algorithms, and exact exponential algorithms.
Prof. Fedor V. Fomin is a professor of algorithms in the Dept. of Informatics of the University of Bergen, Norway. His research interests are largely in the areas of a lgorithms and c ombinatorics, in particular: parameterized complexity, a l gorithms, and kernelization; exact (exponential time) algorithms; graph algorithms, in particular algorithmic graph minors; graph coloring and different modifications; graph widths parameters (treewidth, branchwidth, clique-width, etc.); and pursuit-evasion and search problems.
Dr. Hab. Lukasz Kowalik is an associate professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include algorithms and graph theory, in particular approximation algorithms, exact algorithms for NP-hard problems, planar graphs, and graph coloring.
Dr. Daniel Lokshtanov is a junior faculty member of the Dept. of Informatics of the University of Bergen, Norway. His research focuses on algorithmic graph theory, and he is the project leader for BeHard, a research project on kernelization.
Dr. Dániel Marx is a senior research fellow at the Institute for Computer Science and Control (SZTAKI) of the Hungarian Academy of Sciences, Budapest, Hungary. His research areas include discrete algorithms, parameterized complexity, and graph theory.
Dr. Marcin Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research focuses on algorithmics, especially fixed parameter tractability and exact computations of NP-hard problems.
Dr. Michal Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research areas include parameterized complexity, moderately exponential-time algorithms, and kernelization.
Prof. Saket Saurabh is a member of the Theoretical Computer Science (TCS) group of The Institute of Mathematical Sciences (CIT Campus) in Chennai, India. His research interests include algorithms and graph theory, in particular, parameterized and exact algorithms.
Content
Introduction.- Kernelization.- Bounded Search Trees.- Iterative Compression.- Randomized Methods in Parameterized Algorithms.- Miscellaneous.- Treewidth.- Finding Cuts and Separators.- Advanced Kernelization Algorithms.- Algebraic Techniques: Sieves, Convolutions, and Polynomials.- Improving Dynamic Programming on Tree Decompositions.- Matroids.- Fixed-Parameter Intractability.- Lower Bounds Based on the Exponential-Time Hypothesis.- Lower Bounds for Kernelization.