23 search results - page 1 / 5 » Parametric Duality and Kernelization: Lower Bounds and Upper... |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
TAPAS
2011
12 years 11 months ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...