Invitation to Fixed Parameter Algorithms

Invitation to Fixed Parameter Algorithms

by Rolf Niedermeier
ISBN-10:
0198566077
ISBN-13:
9780198566076
Pub. Date:
03/30/2006
Publisher:
Oxford University Press

Hardcover - Rent for

Select a Purchase Option (New Edition)
  • purchase options
    $140.00
  • purchase options

Overview

Invitation to Fixed Parameter Algorithms

A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. 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 hard 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 essential from parameterized hardness 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.

Product Details

ISBN-13: 9780198566076
Publisher: Oxford University Press
Publication date: 03/30/2006
Series: Oxford Lecture Series in Mathematics and Its Applications Series , #31
Edition description: New Edition
Pages: 312
Product dimensions: 9.30(w) x 6.30(h) x 1.00(d)

Table of Contents

Part I: Foundations
1. Introduction to Fixed-Parameter Algorithms
2. Preliminaries and Agreements
3. Parameterized Complexity Theory - A Primer
4. Vertex Cover - An Illustrative Example
5. The Art of Problem Parameterization
6. Summary and Concluding Remarks
Part II: Algorithmic Methods
7. Data Reduction and Problem Kernels
8. Depth-Bounded Search Trees
9. Dynamic Programming
10. Tree Decompositions of Graphs
11. Further Advanced Techniques
12. Summary and Concluding Remarks
Part III: Some Theory, Some Case Studies
13. Parameterized Complexity Theory
14. Connections to Approximation Algorithms
15. Selected Case Studies
16. Zukunftsmusik
References
Index

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews