In Section 2 we describe SDP relaxations for graph coloring and vertex cover. In Section 3 we present the construction of a family of gap examples for the SDP.
We investigate the power of a strengthened SDP relaxation for graph coloring whose value is equal to a variant of the Lovász ϑ-function.
We investigate the power of a strengthened SDP relaxation for graph coloring whose value is equal to a variant of the Lovász ϑ-function.
Sep 19, 2006 · Charikar, M.: On semidefinite programming relaxations for graph coloring and vertex cover. In: Proceedings of the 41th Annual ACM-SIAM ...
Dec 7, 2012 · Bibliographic details on On semidefinite programming relaxations for graph coloring and vertex cover.
This work investigates computational simplifications for graphs with rich automorphism groups, and explores several strengthenings of the Lovász theta ...
[PDF] Approximate Graph Coloring by Semidefinite Programming - People
people.csail.mit.edu › kms-conf
We investigate the approximation error inherent in our formulation of the chromatic number via semi-definite programming in Section 10. 2 A Vector Relaxation of ...
Oct 22, 2024 · This semidefinite programming formulation can be tightened toward either χ(G) or ω(G) by adding several types of cutting planes. We explore ...
This paper considers the interplay between semidefinite programming, matrix rank, and graph coloring. Karger, Motwani, and Sudan \cite{KMS98} give a vector ...
Charikar, M.: On semidefinite programming relaxations for graph coloring and vertex cover. In: SODA '02: Proceedings of the thirteenth annual ACM-SIAM.