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
Subexponential parameterized algorithm for minimum fill-in
Fedor V. Fomin,Yngve Villanger +1 more
TL;DR: The first subexponential parameterized algorithm for the minimum fill-in problem was given in this paper, which can be solved in time O(2O(k) + k2nm) on graphs with n vertices and m edges.
Proceedings Article
Committee Selection with Intraclass and Interclass Synergies.
TL;DR: This paper considers classes of alternatives, and model both intraclass relations and interclass relations by functions, which are referred to as synergy functions, and study the computational complexity of identifying the best committee, taking into account those synergy functions.
Journal ArticleDOI
The complexity of degree anonymization by vertex addition
Robert Bredereck,Vincent Froese,Sepp Hartung,André Nichterlein,Rolf Niedermeier,Nimrod Talmon +5 more
TL;DR: This work studies the problem of making an undirected graph k-anonymous by adding few vertices (together with some incident edges) and derives mostly intractability results, but also obtains some encouraging fixed-parameter tractability results.
Book ChapterDOI
Resolving the complexity of some data privacy problems
Jeremiah Blocki,Ryan Williams +1 more
TL;DR: This work formally study two methods for data sanitation that have been used extensively in the database community: k-anonymity and l- diversity, and settles several open problems concerning the difficulty of applying these methods optimally.
Book ChapterDOI
Backdoors to acyclic SAT
Serge Gaspers,Stefan Szeider +1 more
TL;DR: The problem of finding backdoor sets of size at most k with respect to the base class of CNF formulas with acyclic incidence graphs is studied, and a new structural parameter is established that makes #SAT fixed-parameter tractable and that is incomparable with known parameters such as treewidth and clique-width.