A better approximation ratio for the Vertex Cover problem

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1043-1050

  Karakostas, George ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PROBLEM SOLVING; RELAXATION PROCESSES;

APPROXIMATION FACTORS; SEMIDEFINITIVE RELAXATION; TRIANGLE INEQUALITIES;

COMPUTER SCIENCE;

EID: 26444578215     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_84     Document Type: Conference Paper

References (14)

1. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. In 37th STOC, 2005 (to appear).
2. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proc. of 36th STOC, pp. 222-231, 2004.
3. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25, pp. 27-45, 1985.
4. M. Charikar. On semidefinite programming relaxations for graph coloring and vertex cover. In Proc. of 13th SODA, pp. 616-620, 2002.
5. R. M. Corless, G. H. Gönnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth. On the Lambert W Function. Advances in Computational Mathematics, vol. 5, pp. 329-359, 1996.
6. I. Dinur and S. Safra. On the importance of being biased (1.36 hardness of approximating Vertex-Cover). Annals of Mathematics, to appear.
7. Also in Proc. of 34th STOC, 2002.
8. M. Goemans and J. Kleinberg. The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. SIAM Journal on Discrete Mathematics 11(2), pp. 196-204, 1998.
9. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. on Computing, 31(5), pp. 1608-1623, 2002.
10. Also in Proc. of 11th SODA, pp. 329-337, 2000.
11. R. Karp. Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher (eds.) Complexity of Computer Computations, Plenum Press, NY, pp. 85-103.
12. J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. SODA 2005 (to appear), see http://www.eecs.berkeley.edu/~jrl.
13. B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica, 22, pp. 115-123, 1985.
14. C. E. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. JCSS, 43(3), pp. 425-440, 1991.