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
Posted Content
The Complexity Landscape of Decompositional Parameters for ILP
Robert Ganian,Sebastian Ordyniak +1 more
TL;DR: In this paper, it was shown that ILP is fixed-parameter tractable when parameterized by the treedepth of the constraint matrix and the maximum absolute value of any coefficient occurring in the ILP instance.
Journal ArticleDOI
Breaking the 2n-barrier for Irredundance: Two lines of attack
Daniel Binkele-Raible,Ljiljana Brankovic,Marek Cygan,Henning Fernau,Joachim Kneis,Dieter Kratsch,Alexander Langer,Mathieu Liedloff,Marcin Pilipczuk,Peter Rossmanith,Jakub Onufry Wojtaszczyk +10 more
TL;DR: In this paper, exact exponential-time algorithms for computing the lower and upper irredundance numbers of a graph G on n vertices with running time O(1.99914^n) and O( 1.9369^n, respectively, were presented.
Proceedings ArticleDOI
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
TL;DR: This work proves that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio unless FPT = W[P].
Journal ArticleDOI
Graph operations characterizing rank-width
TL;DR: This work defines operations on graphs that characterize rank-width and help for the construction of Fixed Parameter Tractable algorithms, especially for problems specified in monadic second-order logic.
Proceedings Article
Fully proportional representation with approval ballots: approximating the maxcover problem with bounded frequencies in FPT time
Piotr Skowron,Piotr Faliszewski +1 more
TL;DR: In this article, the authors considered the problem of winner determination under Chamberlin-Courant's multiwinner voting rule with approval utilities and showed an exponential-time/FPT approximation algorithm that achieves arbitrarily good approximation ratios and running times much better than known exact algorithms.