Feedback Vertex Set

  • Vijay V. Vazirani


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 20.
    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.Google Scholar
  2. 24.
    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.Google Scholar
  3. 48.
    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.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations