The field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society.
This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research.
Topics and features:
Describes many of the standard algorithmic techniques available for establishing parametric tractability
Reviews the classical hardness classes
Explores the various limitations and relaxations of the methods
Showcases the powerful new lower bound techniques
Examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach
Demonstrates how complexity methods and ideas have evolved over the past 25 years
This classroom-tested and easy-to-follow textbook/reference is essential reading for the beginning graduate student and advanced undergraduate student. The book will also serve as an invaluable resource for the general computer scientist and the mathematically-aware scientist seeking tools for their research.
