Parameterized Algorithms
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 bas...
| Main Authors: | , , , , , , , |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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.