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

一种新的多层PCP及超图顶点覆盖的硬度

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev

摘要:

给定一个$k$ -一致超图,E $k$ -顶点覆盖问题是寻找与其所有超边相交的顶点的最小子集.我们提出了一个新的多层PCP建设,扩展了拉兹验证。这使我们能够证明,E $k$ -顶点覆盖是NP-困难的,以接近任何$k \geq 3$和任何$ε>0$的因素$(k-1-ε)$。结果基本上是紧的,因为这个问题可以很容易地在因子$k$内近似。我们的建设利用有偏的长码,并使用组合性质的$s$明智的$t$交叉家庭的子集进行分析。

英文摘要:

Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier. This enables us to prove that E$k$-Vertex-Cover is NP-hard to approximate within factor $(k-1-ε)$ for any $k \geq 3$ and any $ε>0$. The result is essentially tight as this problem can be easily approximated within factor $k$. Our construction makes use of the biased Long-Code and is analyzed using combinatorial properties of $s$-wise $t$-intersecting families of subsets.

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

↑