On hard instances of approximate vertex cover

ACM Transactions on Algorithms

Volumn 5, Issue 1, 2008, Pages

  Vishwanathan, Sundar ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Approximation algorithms; Vertex cover

Indexed keywords

POLYNOMIAL APPROXIMATION;

CHROMATIC NUMBERS; HARD INSTANCES; VERTEX COVER;

APPROXIMATION ALGORITHMS;

EID: 57849119303     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1435375.1435382     Document Type: Article

References (15)

1. BAR-YEHUDA, R., AND EVEN, S. 1985. A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Disc. Math. 25, 27-45.
2. BLUM, A. 1994. New approximation algorithms for graph coloring. J. ACM 41, 3, 470-516.
3. 3/14)-coloring algorithm for 3-colorable graphs. Inf. Proc. Lett. 61, 1, 49-53.
4. CHARIKAR, M. 2002. On semidefinite programming relaxations of graph coloring and vertex cover. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 616-620.
5. DINUR, I., AND SAFRA, S. 2005. On the hardness of approximating minimum vertex cover. Ann. Math. 162, 1.
6. FEIGE, U., LANGBERG, M., AND SCHECHTMAN, G. 2002. Graphs with tiny vector chromatic numbers and huge chromatic numbers. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 283-292.
7. GOEMANS, M., AND WILLIAMSON, D. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145.
8. GROTSCHEL, M., LÓVASZ, L., AND SCHRIJVER, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 2, 169-197.
9. HALPERIN, E. 2002. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31, 1608-1623.
10. KARAKOSTAS, G. 2005. A better approximation ratio for the vertex cover problem. In Proceedings of the 32nd International Conference on Automata Languages and Programming. ACM, New York, 1043-1050.
11. KARGER, D. R., MOTWANI, R., AND SUDAN, M. 1994. Approximate graph coloring by semidefinite programming. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 2-13.
12. KHOT, S., AND REGEV, O. 2003. Vertex cover might be hard to approximate to within 2-ε. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 379-386.
13. KLEINBERG, J. M., AND GOEMANS, M. X. 1998. The Lóvasz theta function and a semidefinite programming relaxation of vertex cover. SIAM J. Disc. Math. 11, 2, 196-204.
14. LÓVASZ, L., AND PLUMMER, M. D. 1986. Matching Theory. North-Holland Mathematics Studies: Annals of Discrete Mathematics. North-Holland, Amsterdam, The Netherlands.
15. MONIEN, B., AND SPECKENMEYER, E. 1985. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inf. 22, 115-123.