Sciweavers

5 search results - page 1 / 1
» Vertex Cover Kernelization Revisited: Upper and Lower Bounds...
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
12 years 11 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 3 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 3 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 6 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek