A new multilayered PCP and the hardness of hypergraph vertex cover

SIAM Journal on Computing

Volumn 34, Issue 5, 2005, Pages 1129-1146

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Washington   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^e TEL AVIV UNIVERSITY   (Israel)

Author keywords

Hardness of approximation; Hypergraph vertex cover; Long code; Multilayered outer verifier; Probabilistically checkable proof

Indexed keywords

HARDNESS OF APPROXIMATION; HYPERGRAPH VERTEX COVER; LONG CODE; MULTILAYER OUTER VERIFIER; PROBABILISTICALLY CHECKABLE PROOF;

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; PROBABILITY; PROBLEM SOLVING; SET THEORY;

GRAPH THEORY;

EID: 27144509145     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704443057     Document Type: Article

References (27)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
2. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
3. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximability - towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
4. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics, 23 (1952), pp. 493-507.
5. J. CHUZHOY, S. GUHA, E. HALPERIN, S. KHANNA, G. KORTSARZ, AND J. NAOR, Asymmetric K-center is log* n hard to approximate, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004, pp. 21-27.
6. P. CRESCENZI, R. SILVESTRI, AND L. TREVISAN, On weighted vs. unweighted versions of combinatorial optimization problems, Inform. and Comput., 167 (2001), pp. 10-26.
7. I. DINUR, V. GURUSWAMI, AND S. KHOT, Vertex Cover on k-Uniform Hypergraphs Is Hard to Approximate within Factor (k - 3 - ε), Tech. report TR02-027, Electronic Colloquium on Computational Complexity, 2002.
8. I. DINUR, O. REGEV, AND C. SMYTH, The hardness of 3-uniform hypergraph coloring, Combinatorica, to appear.
9. I. DINUR AND S. SAFRA, The importance of being biased, Ann. of Math., to appear.
10. U. FEIGE, A threshold of ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
11. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Interactive proofs and the hardness of approximating cliques, J. ACM, 43 (1996), pp. 268-292.
12. O. GOLDREICH, Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs, Tech. report TR01-102, Electronic Colloquium on Computational Complexity, 2001.
13. V. GURUSWAMI, J. HÅSTAD, AND M. SUDAN, Hardness of approximate hypergraph coloring, SIAM J. Comput., 31 (2002), pp. 1663-1686.
14. E. HALPERIN, Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs, SIAM J. Comput., 31 (2002), pp. 1608-1623.
15. R. L. GRAHAM, M. GRÖTSCHEL, AND L. LOVÁSZ, EDS., Handbook of Combinatorics, Vols. 1 and 2, Elsevier Science, Amsterdam, 1995.
16. 1-ε, Acta Math. 182 (1999), pp. 105-142.
17. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
18. J. HOLMERIN, Vertex cover on 4-uniform hypergraphs is hard to approximate within 2 - ε, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 544-552.
19. J. HOLMERIN, Improved inapproximability results for vertex cover on k-uniform hypergraphs, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 1005-1016.
20. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
21. S. KHOT, Hardness results for coloring 3-colorable 3-uniform hypergraphs, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 23-32.
22. S. KHOT AND O. REGEV, Vertex cover might be hard to approximate to within 2 - ε, in Proceedings of 18th IEEE Annual Conference on Computational Complexity (CCC), 2003, pp. 379-386.
23. L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
24. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
25. R. RAZ AND S. SAFRA, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 475-484.
26. A. SAMORODNITSKY AND L. TREVISAN, A PCP characterization of NP with optimal amortized query complexity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 191-199.
27. L. TREVISAN, Non-approximability results for optimization problems on bounded degree instances, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 453-461.