Abstract
In this chapter we will use the technique of layering, introduced in Chapter 2, to obtain a factor 2 approximation algorithm for the following problem. Recall that the idea behind layering was to decompose the given weight function into convenient functions on a nested sequence of subgraphs of G.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
V. Bafna, P. Berman, and T. Fujito. Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In Algorithms and Computation, 6th International Symposium, ISAAC, volume 1004 of Lecture Notes in Computer Science, pages 142–151. Springer-Verlag, Berlin, 1995.
A. Becker and D. Geiger. Approximation algorithms for the loop cutset problem. In Proc. 10th Conference on Uncertainty in Artificial Intelligence, pages 60–68, 1994.
F. Chudak, M.X. Goemans, D. Hochbaum, and D.P. Williamson. A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Operations Research Letters, 22: 111–118, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Feedback Vertex Set. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive