arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.00753cs.CC
收藏

在因子$2 - ε$内没有小线性规划逼近顶点覆盖

No Small Linear Program Approximates Vertex Cover within a Factor $2 - ε$

Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson

摘要:

顶点覆盖问题是组合优化中最重要、研究最多的问题之一。Khot和Regev(2003)证明了这个问题是NP-难的,在一个因子$2 - ε$内近似,假设唯一博弈猜想(UGC)。这是严格的,因为该问题有一个简单的2-近似算法。在不求助于UGC的情况下,该问题的最佳不可逼近性结果来自Dinur和Safra(2002):顶点覆盖在因子1.3606内是NP难近似的。我们证明了关于该问题的线性规划松弛的下列无条件结果:每个在因子$2-ε$内逼近顶点覆盖的线性规划松弛都有超多项式多个不等式.作为我们的方法的一个直接后果,我们还建立了LP松弛(以及SDP松弛),近似的独立集问题在任何常数因子具有超多项式的大小。

英文摘要:

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - ε$, assuming the Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. Without resorting to the UGC, the best inapproximability result for the problem is due to Dinur and Safra (2002): vertex cover is NP-hard to approximate within a factor 1.3606. We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates vertex cover within a factor $2-ε$ has super-polynomially many inequalities. As a direct consequence of our methods, we also establish that LP relaxations (as well as SDP relaxations) that approximate the independent set problem within any constant factor have super-polynomial size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑