Abstract
We consider the weighted feedback vertex set problem for undirected graphs. It is shown that a generalized local ratio strategy leads to an efficient approximation with the performance guarantee of twice the optimal, improving the previous results for both weighted and unweighted cases. We further elaborate our approach to treat the case when graphs are of bounded degree, and show that it achieves even better performance, 2−2/3Δ−2, where Δ is the maximum degree of graphs.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
