On Hard Instances of Approximate Vertex Cover
We show that if there is a 2 - is an element of approximation algorithm for vertex cover on graphs with vector chromatic number at most 2 + delta, then there is a 2 - f (is an element of, delta) approximation algorithm for vertex cover for all graphs.
vertex cover approximation algorithms