Inapproximability of vertex cover and independent set in bounded degree graphs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 74-80

  Austrin, Per ^c   Khot, Subhash ^a   Safra, Muli ^b  

^a NEW YORK UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DEGREE GRAPHS; HARDNESS RESULT; INAPPROXIMABILITY; INDEPENDENT SET; UNIQUE GAMES; VERTEX COVER;

COMPUTATIONAL COMPLEXITY;

EID: 70350626961     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2009.38     Document Type: Conference Paper

References (15)

1. E. Halperin, "Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs, " SIAM J. Comput., vol. 31, no. 5, pp. 1608-1623, 2002.
2. A. Samorodnitsky and L. Trevisan, "Gowers Uniformity, Influence of Variables, and PCPs, " in ACM Symposium on Theory of Computing (STOC), 2006, pp. 11-20.
3. S. Khot and O. Regev, "Vertex Cover Might be Hard to Approximate to Within 2-ε, " Journal of Computer and System Sciences, vol. 74, no. 3, pp. 335-349, 2008.
4. I. Dinur and S. Safra, "On the Hardness of Approximating Minimum Vertex Cover, " Annals of Mathematics, vol. 162, no. 1, pp. 439-485, 2005. (Pubitemid 43034608)
5. M. M. Halldórsson, "Approximations of Weighted Independent Set and Hereditary Subset Problems, " in COCOON, 1999, pp. 261-270.
6. A. Samorodnitsky and L. Trevisan, "A PCP characterization of NP with optimal amortized query complexity, " in ACM Symposium on Theory of Computing (STOC), 2000, pp. 191-199.
7. U. Feige, "Approximating Maximum Clique by Removing Subgraphs, " SIAM J. Discrete Math., vol. 18, no. 2, pp. 219-225, 2004.
8. 1-ε, " Acta Mathematica, vol. 48, no. 4, pp. 105-142, 1999.
9. S. Khot and A. K. Ponnuswami, "Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion, " in International Colloquium on Automata, Languages and Programming (ICALP), 2006, pp. 226-237.
10. I. Dinur, E. Mossel, and O. Regev, "Conditional Hardness for Approximate Coloring, " in ACM Symposium on Theory of Computing (STOC), 2006, pp. 344-353.
11. E. Mossel, R. O'Donnell, and K. Oleszkiewicz, "Noise Stability of Functions With Low Influences: Invariance and Optimality, " 2009, to appear in Annals of Mathematics.
12. S. Khot, "On the Power of Unique 2-prover 1-round Games, " in ACM Symposium on Theory of Computing (STOC), 2002, pp. 767-775. (Pubitemid 35009440)
13. P. Austrin, "Balanced Max 2-Sat Might Not be the Hardest, " in ACM Symposium on Theory of Computing (STOC), 2007, pp. 189-197.
14. E. de Klerk, D. V. Pasechnik, and J. P. Warners, "On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the V-Function, " Journal of Combinatorial Optimization, vol. 8, no. 3, pp. 267-294, 2004.
15. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, "Optimal Inapproximability Results for MAX-CUT and Other 2-variable CSPs?" Siam Journal on Computing, vol. 37, pp. 319-357, 2007.