Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs

Using known results regarding PCP, we present simple proofs of the inapproximability of vertex cover for hypergraphs. Specifically, we show that 1. Approximating the size of the minimum vertex cover in O(1)-regular hypergraphs to within a factor of 1.99999 is NP-hard.

[1]  Oded Goldreich,et al.  Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.

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

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

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

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

[6]  Erez Petrank.  The hardness of approximation: Gap location , 2005, computational complexity.

[7]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

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

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

[10]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Dinur,et al.  A new multilayered PCP and the hardness of hypergraph vertex cover , 2003, STOC '03.

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

[13]  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..

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

[15]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

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

[17]  Subhash Khot,et al.  Query efficient PCPs with perfect completeness , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[19]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[20]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.