A new multilayered PCP and the hardness of hypergraph vertex cover

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 595-601

  Dinur, Irit ^a   Khot, Subhash ^b   Guruswami, Venkatesan ^c   Regev, Oded ^d  

^a NEC LABORATORIES AMERICA   (United States)

^b Princeton University   (United States)

^c University of Washington   (United States)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Hardness of Approximation; Hypergraph Vertex Cover; Long Code; Multilayered PCP

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; SET THEORY;

HYPERGRAPHS;

GRAPH THEORY;

EID: 0038107530     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780627.780629     Document Type: Conference Paper

References (23)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3) : 501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs : A new characterization of NP. Journal of the ACM, 45(1) : 70-122, 1998.
3. M. Bellare, O. Goldreich and M. Sudan. Free bits, PCPs and non-approximability. SIAM Journal on Computing, 27(3):804-915, June 1998.
4. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics, 23:493-507, 1952.
5. I. Dinur, V. Guruswami and S. Khot. Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k -3 - ε). Electronic Colloquium on Computational Complexity, Technical Report TR02-027, 2002.
6. I. Dinur, O. Regev and C. Smyth. The hardness of 3-uniform hypergraph coloring. In Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 33-42.
7. I. Dinur and S. Safra. The importance of being biased. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 33-42, May 2002.
8. U. Feige. A threshold of ln n for approximating set cover. JACM: Journal of the ACM, 45, 1998.
9. U. Feige, S. Goldwasser, L. Lovász, S. Safra and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, March 1996.
10. O. Goldreich. Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. ECCC Technical Report TR01-102, December 2001.
11. V. Guruswami, J. Håstad and M. Sudan. Hardness of approximate hypergraph coloring. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 149-158, November 2000.
12. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 329-337, January 2000.
13. R. L. Graham, M. Grötschel, and L. Lovász, editors. Handbook of combinatorics. Vol. 1, 2. Elsevier Science B.V., Amsterdam, 1995.
14. 1-ε. Acta, Mathematica, 182(1):105-142, 1999.
15. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, July 2001.
16. J. Holmerin. Vertex cover on 4-uniform hypergraphs is hard to approximate within 2 - ε. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 544-552, May 2002.
17. J. Holmerin. Improved inapproximability results for vertex cover on k-uniform hypergraphs. Proc. of the 29th International Colloquium on Automata, Languages and Programming (ICALP), pages 1005-1016, July 2002.
18. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
19. S. Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. In Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 23-32, November 2002.
20. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
21. R. Raz. A parallel repetition theorem. SIAM J. of Computing, vol 27(3), 763-803, 1998.
22. A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. of the 32nd Annual ACM Symposium on Theory of Computing, pages 191-199, 2000.
23. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proc. of the Annual ACM 33rd Symposium on Theory of Computing, pages 453-461, July 2001.