Invitation to Fixed-Parameter Algorithms
Rolf Niedermeier
Abstract
This book provides an introduction to the concept of fixed-parameter tractability. The corresponding design and analysis of efficient fixed-parameter algorithms for optimally solving combinatorially explosive (NP-hard) discrete problems is a vividly developing field, with a growing list of applications in various contexts such as network analysis or bioinformatics. The book emphasizes algorithmic techniques over computational complexity theory. It is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods d ... More
Keywords: fixed-parameter tractability, parameterized complexity, NP-hardness, optimal solution, algorithmic techniques, discrete problems, combinatorial explosion
Bibliographic Information
| Print publication date: 2006 | Print ISBN-13: 9780198566076 |
| Published to Oxford Scholarship Online: September 2007 | DOI:10.1093/acprof:oso/9780198566076.001.0001 |
