Abstract
We show that if there is a 2 - ϵ approximation algorithm for vertex cover on graphs with vector chromatic number at most 2 + δ, then there is a 2 - f (ϵ, δ) approximation algorithm for vertex cover for all graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
