Polynomial Kernelizations For MIN F+Pi1 And MAX NP

Kratsch, Stefan

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Polynomial Kernelizations For MIN F+Pi1 And MAX NP

MPS-Authors

/persons/resource/persons44840

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

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.

引用: https://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).