Abstract
We consider the vertex cover and feedback vertex set problems for undirected graphs, and show that they are structurally closely related via the standard vector spaces associated with the graphs. This observation will then be used to demonstrate that these two problems can be efficiently approximated within a same constant factor of 2 by essentially the same heuristics.
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
