scispace - formally typeset
Open AccessBook

Parameterized complexity theory

Jörg Flum, +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

Faster Parameterized Algorithms Using Linear Programming

Daniel Lokshtanov, +4 more
- 30 Oct 2014 - 
TL;DR: It is argued that combining previously known preprocessing rules with the most straightforward branching algorithm yields an O*(2.618k) algorithm for the problem, and a kernel is obtained for the standard parameterization of Vertex Cover with at most 2k − clog k vertices, simpler than previously known kernels achieving the same size bound.
Proceedings ArticleDOI

Known algorithms on graphs of bounded treewidth are probably optimal

Daniel Lokshtanov, +2 more
TL;DR: In this paper, the authors obtained lower bounds on the running time of algorithms for solving problems on graphs of bounded treewidth, and proved the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi, assuming that SAT cannot be solved in (2 - ∈)nmO(1) time.
Posted Content

A survey on algorithmic aspects of modular decomposition

Michel Habib, +1 more
- 08 Dec 2009 - 
TL;DR: This paper survey the ideas and techniques that arose from this line of research on modular decomposition.
Book ChapterDOI

Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics

Andrei Lopatenko, +1 more
TL;DR: In this paper, the authors considered the cardinality-based repair semantics for consistent query answering in a dynamic setting, where a consistent database is affected by a sequence of updates, which may make it inconsistent.
Journal ArticleDOI

Algorithms for propositional model counting

Marko Samer, +1 more
- 01 Mar 2010 - 
TL;DR: Algorithms for the propositional model counting problem #SAT utilize tree decompositions of certain graphs associated with the given CNF formula, including primal, dual, and incidence graphs.