Open AccessBook
Parameterized complexity theory
Jörg Flum,Martin Grohe +1 more
TLDR
Fixed-Parameter Tractability.Abstract:
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The W-Hierarchy.- The A- Hierarchy.- Kernelization and Linear Programming Techniques.- The Automata-Theoretic Approach.- Tree Width.- Planarity and Bounded Local Tree Width.- Homomorphisms and Embeddings.- Parameterized Counting Problems.- Bounded Fixed-Parameter Tractability.- Subexponential Fixed-Parameter Tractability.- Appendix, Background from Complexity Theory.- References.- Notation.- Index.read more
Citations
More filters
Journal ArticleDOI
Local search: Is brute-force avoidable?
Michael R. Fellows,Fedor V. Fomin,Daniel Lokshtanov,Frances A. Rosamond,Saket Saurabh,Yngve Villanger +5 more
TL;DR: In this paper, the authors show that for several classes of sparse graphs, including planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor, an improved solution in the k-exchange neighborhood for many problems can be found much more efficiently.
Proceedings ArticleDOI
Generalized hypertree decompositions: np-hardness and tractable variants
TL;DR: It is proven that determining whether a hypergraph H admits a tree projection with respect to ahypergraph G is NP-complete, and the new Component Hypertree Decomposition method is defined, which is tractable and strictly more general than other approximations to GHD published so far.
Proceedings ArticleDOI
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
TL;DR: In this article, a fixed-parameter algorithm with randomized contractions was proposed for the problem of solving the Steiner CUT problem, which has a single exponential dependency on the size of the cutset and the alphabet.
Book ChapterDOI
On notions of regularity for data languages
TL;DR: A simpler but equivalent model for data automata is introduced and its expressive power, algorithmic and closure properties and some extensions are investigated.
Journal ArticleDOI
Techniques for Practical Fixed-Parameter Algorithms
TL;DR: Three main techniques to develop fixed-parameter algorithms are surveyed, namely: kernelization (data reduction with provable performance guarantee), depthbounded search trees and a new technique called iterative compression.