Vertex cover might be hard to approximate to within 2 - ε

Journal of Computer and System Sciences

Volumn 74, Issue 3, 2008, Pages 335-349

  Khot, Subhash ^a   Regev, Oded ^b  

^a Princeton University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Hardness of approximation; Unique games conjecture; Vertex cover

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; PROBLEM SOLVING; SYSTEMS SCIENCE;

CONSTANT FACTORS; HARDNESS OF APPROXIMATION; UNIQUE GAMES CONJECTURE; VERTEX COVERS;

GAME THEORY;

EID: 38149105774     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.06.019     Document Type: Article

References (30)

1. S. Arora, B. Bollobás, L. Lovász, Proving integrality gaps without knowing the linear program, in: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, Canada, Nov. 2002, pp. 313-322
2. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and the hardness of approximation problems. J. ACM 45 3 (1998) 501-555
3. Arora S., and Safra S. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45 1 (1998) 70-122
4. Bellare M., Goldreich O., and Sudan M. Free bits, PCPs, and nonapproximability-Towards tight results. SIAM J. Comput. 27 3 (1998) 804-915
5. M. Charikar, K. Makarychev, Y. Makarychev, Near-optimal algorithms for unique games, in: Proceedings of the 38th ACM Symposium on Theory of Computing, STOC 2006
6. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, D. Sivakumar, On the hardness of approximating sparsest cut and multicut, in: Proc. of 20th IEEE Annual Conference on Computational Complexity, CCC 2005, pp. 144-153
7. I. Dinur, V. Guruswami, S. Khot, Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k - 3 - ε), in: Electronic Colloquium on Computational Complexity, Technical Report TR02-027, 2002
8. Dinur I., Guruswami V., Khot S., and Regev O. A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput. 34 5 (2005) 1129-1146
9. I. Dinur, E. Mossel, O. Regev, Conditional hardness for approximate coloring, in: Proc. 38th ACM Symp. on Theory of Computing, STOC 2006
10. Dinur I., and Safra S. On the hardness of approximating minimum vertex cover. Ann. of Math. 162 1 (2005) preliminary version in STOC 2002
11. U. Feige, S. Goldwasser, L. Lovász, S. Safra, M. Szegedy, Approximating clique is almost NP-complete, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science, FOCS 1991, pp. 2-12
12. Friedgut E. Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18 1 (1998) 27-35
13. O. Goldreich, Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs, ECCC Technical Report TR01-102, 2001
14. A. Gupta, K. Talwar, Approximating unique games, in: Proceedings of Annual Symposium on Discrete Algorithms, SODA 2006, pp. 99-106
15. Guruswami V., Håstad J., and Sudan M. Hardness of approximate hypergraph coloring. SIAM J. Comput. 31 6 (2002) 1663-1686
16. Halperin E. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31 5 (2002) 1608-1623
17. 1 - ε. Acta Math. 182 1 (1999) 105-142
18. Håstad J. Some optimal inapproximability results. J. ACM 48 4 (2001) 798-859
19. J. Holmerin, Improved inapproximability results for vertex cover on k-regular hyper-graphs, in: International Colloquium on Automata, Languages, and Programming, ICALP 2002, pp. 1005-1016
20. J. Holmerin, Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε, in: Proc. 34th ACM Symp. on Theory of Computing, STOC 2002, pp. 544-552
21. G. Karakostas, A better approximation ratio for the vertex cover problem, in: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP, Lisboa, Portugal, July 2005, pp. 1043-1050
22. S. Khot, On the power of unique 2-Prover 1-Round games, in: Proc. 34th ACM Symp. on Theory of Computing, STOC, May 2002, pp. 767-775
23. S. Khot, G. Kindler, E. Mossel, R. O'Donnell, Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?, in: Proc. 45th IEEE Symp. on Foundations of Computer Science, FOCS 2004, pp. 146-154
24. 1, in: Proc. 46th IEEE Symp. on Foundations of Computer Science, FOCS 2005, pp. 53-62
25. Margulis G. Probabilistic characteristics of graphs with large connectivity. Prob. Peredachi Inform. 10 (1974) 101-108
26. E. Mossel, R. O'Donnell, K. Oleszkiewicz, Noise stability of functions with low influences, invariance and optimality, in: Proc. 46th IEEE Symp. on Foundations of Computer Science, FOCS 2005, pp. 21-30
27. Raz R. A parallel repetition theorem. SIAM J. Comput. 27 3 (1998) 763-803
28. Russo L. An approximate zero-one law. Z. Wahrsch. Verw. Gebiete 61 1 (1982) 129-139
29. L. Trevisan, Non-approximability results for optimization problems on bounded degree instances, in: Proc. 33rd ACM Symp. on Theory of Computing, STOC 2001, pp. 453-461
30. L. Trevisan, Approximation algorithms for unique games, in: Proceedings of the 46th Annual Symposium on Foundations of Computer Science, FOCS 2005, 2005, pp. 197-205