A new multilayered PCP and the hardness of hypergraph vertex cover

Given a k-uniform hyper-graph, the Ek-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 Ek-Vertex-Cover is NP-hard to approximate within factor (k-1-ε) for any k ≥ 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.

[1]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[2]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[3]  Venkatesan Guruswami,et al.  Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) , 2002, Electron. Colloquium Comput. Complex..

[4]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[5]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[6]  Sudipto Guha,et al.  Asymmetric k-center is log* n-hard to approximate , 2004, STOC '04.

[7]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[8]  Jonas Holmerin,et al.  Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs , 2002, ICALP.

[9]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[10]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[11]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[13]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[14]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..

[15]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[16]  Arild Stubhaug.  Acta Mathematica , 1886, Nature.

[17]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[18]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[19]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[20]  Irit Dinur,et al.  The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..

[21]  Luca Trevisan,et al.  On Weighted vs Unweighted Versions of Combinatorial Optimization Problems , 2001, Inf. Comput..

[22]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[23]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[24]  Subhash Khot,et al.  Hardness results for coloring 3-colorable 3-uniform hypergraphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[25]  Jonas Holmerin.  Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε , 2002, STOC '02.

[26]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[27]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[28]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.