New approximation algorithms for graph coloring
Journal of the ACM (JACM)
An Õ(n3/14)-coloring algorithm for 3-colorable graphs
Information Processing Letters
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
SIAM Journal on Discrete Mathematics
On semidefinite programming relaxations for graph coloring and vertex cover
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Approximate graph coloring by semidefinite programming
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
We show that if there is a 2 − &epsis; approximation algorithm for vertex cover on graphs with vector chromatic number at most 2 + δ, then there is a 2 − f(&epsis;, δ) approximation algorithm for vertex cover for all graphs.