The Lovász theta function and a semidefinite programming relaxation of vertex cover

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 2, 1998, Pages 196-204

  Kleinberg, Jon ^a,b   Goemans, Michel X ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Independent sets; Semidefinite programming; Vertex cover

Indexed keywords

EID: 0011190325     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195287541     Document Type: Article

References (15)

1. N. ALON AND N. KAHALE, Approximating the independence number via the θ-function, manuscript, 1996.
2. R. BAR-YEHUDA AND S. EVEN, A local-ratio theorem for approximating the weighted vertex cover problem, in Analysis and Design of Algorithms for Combinatorial Problems, Elsevier, Amsterdam, 1985, pp. 27-46.
3. K. BORSUK, Drei Sätze über die n-dimensionale euklidische Sphäre, Fundamenta Math., 20 (1933), pp. 177-190.
4. U. FEIGE, Randomized graph products, chromatic numbers, and the Lovász θ-function, in Proc. 27th Annual ACM Symposium on Theory of Computing, ACM, New York, 1995, pp. 635-640.
5. P. FRANKL AND V. RÖDL, Forbidden intersections, Trans. Amer. Math. Soc., 300 (1987), pp. 259-286.
6. M. GOEMANS AND D. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145. (Preliminary version in Proc. 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 422-431.)
7. M. GOEMANS AND D. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145. (Preliminary version in Proc. 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 422-431.)
8. D. HOCHBAUM, Approximation algorithms for set covering and vertex cover problems, SIAM J. Comput., 11 (1982), pp. 555-556.
9. J. KAHN AND G. KALAI, A counterexample to Borsuk's conjecture, Bull. Amer. Math. Soc., 29 (1993), pp. 60-62.
10. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, in Proc. 35th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 2-13.
11. J. LAGERGREN AND A. RUSSELL, Vertex Cover Eludes the Schrijver Function, manuscript, 1997.
12. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
13. L. LOVÁSZ, Self-dual polytopes and the chromatic number of distance graphs on the sphere, Acta Sci. Math., 45 (1983), pp. 317-323.
14. B. MONIEN AND E. SPECKENMEYER, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inform., 22 (1985), pp. 115-123.
15. A. SCHRIJVER, A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory, 25 (1979), pp. 425-429.