常数逼近参数化的$k$ - SetCover是W[2]-困难的
Constant Approximating Parameterized $k$-SetCover is W[2]-hard
摘要:
在本文中,我们证明了在任意常数比下,k-集合覆盖的逼近是W[2]-困难的。我们的证明是建立在最近开发的阈值图组成技术。我们提出了一个强有力的阈值图的概念,并使用一个新的组合方法来证明这一结果。我们的技术也可以应用于排除多项式时间$o\left(\frac{\log n}{\log \log n}\right)$比率近似算法的非参数化的k-SetCover问题,$k$小到$O\left(\frac{\log n}{\log \log n}\right)^3$,假设W[1] $\neq$ FPT。我们强调,我们的证明不依赖于著名的PCP定理,只涉及简单的组合对象。
英文摘要:
In this paper, we prove that it is W[2]-hard to approximate k-SetCover within any constant ratio. Our proof is built upon the recently developed threshold graph composition technique. We propose a strong notion of threshold graphs and use a new composition method to prove this result. Our technique could also be applied to rule out polynomial time $o\left(\frac{\log n}{\log \log n}\right)$ ratio approximation algorithms for the non-parameterized k-SetCover problem with $k$ as small as $O\left(\frac{\log n}{\log \log n}\right)^3$, assuming W[1]$\neq$FPT. We highlight that our proof does not depend on the well-known PCP theorem, and only involves simple combinatorial objects.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。