User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Conference Paper

Polynomial Kernelizations For MIN F+Pi1 And MAX NP


Kratsch,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Kratsch, S. (2009). Polynomial Kernelizations For MIN F+Pi1 And MAX NP. In S. Albers, & J.-Y. Marion (Eds.), 26th International Symposium on Theoretical Aspects of Computer Science. Wadern: Schloss Dagstuhl.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-18B7-F
The relation of constant-factor approximability to fixed-parameter tractability and kernelization is a long-standing open question. We prove that two large classes of constant-factor approximable problems, namely~$\textsc{MIN F}^+\Pi_1$ and~$\textsc{MAX NP}$, including the well-known subclass~$\textsc{MAX SNP}$, admit polynomial kernelizations for their natural decision versions. This extends results of Cai and Chen (JCSS 1997), stating that the standard parameterizations of problems in~$\textsc{MAX SNP}$ and~$\textsc{MIN F}^+\Pi_1$ are fixed-parameter tractable, and complements recent research on problems that do not admit polynomial kernelizations (Bodlaender et al.\ ICALP 2008).