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
Proceedings ArticleDOI
Does query evaluation tractability help query containment
TL;DR: This work investigates to which extent restrictions on UCQs and UC2RPQs, which have been known to reduce the complexity of query containment for these classes, yield a more "manageable" single-exponential time bound, which is the norm for several static analysis and verification tasks.
Proceedings ArticleDOI
Interval vertex deletion admits a polynomial kernel
TL;DR: The existence of a polynomial kernel for interval vertex deletion is known to be NP-complete as discussed by the authors, but the existence of such a kernel is open in Parameterized Complexity.
Posted Content
Feedback Vertex Set in Mixed Graphs
Paul Bonsma,Daniel Lokshtanov +1 more
TL;DR: This work presents an algorithm for deciding whether a given mixed graph on n vertices contains a feedback vertex set (FVS) of size at most k, in time O(47.5k ċ k! ċ n4).
Journal ArticleDOI
FPT approximation schemes for maximizing submodular functions
TL;DR: It is argued that many real-life problems can be expressed as maximization of submodular, p -separable functions, with low values of the parameter p, and FPT approximation schemes for the minimization and maximization variants of the problem are presented.
Book ChapterDOI
On the Hardness of Losing Weight
Andrei Krokhin,Dániel Marx +1 more
TL;DR: This work studies the complexity of local search for the Boolean constraint satisfaction problem, and classifies the complexity, both classical and parameterized, of such problems by a Schaefer-style dichotomy result, that is, with a restricted set of allowed types of constraints.