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.
Supported by Special Year National Science Foundation grant BIR-9412594.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, and M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Symp. on Foundations of Computer Science, 1992.
Bar-Yehuda, R. and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. In Annals of Discrete Mathematics 25. North-Holland, 1985.
R. Bar-Yehuda, D. Geiger, J. Naor and R. M. Roth. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. In Proc. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 344–354, 1994.
A. Becker and D. Geiger. Approximation algorithms for the loop cutset problem. In Uncertainity in Artificial Intelligence, 9, 1994.
P. Berman. [personal communication]
M. R. Garey and D. S. Johnson. COMPUTERS AND INTRACTABILITY: A Guide to the Theory of NP-Completeness. W. H. Freeman and co., 1979.
M.M. Halldórsson. Approximations via partitioning. Technical report, Japan Advanced Inst. of Sci. and Tech., March 1995.
D.S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243–254, 1983.
R.M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, 1972.
L. Lovász and M.D. Plummer. Matching Theory. North-Holland, 1986.
J.M. Lewis and M. Yannakakis. The Node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20:219–230, 1980.
C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In Proc. of 20th International Colloquium on Automata, Languages and Programming, pages 40–51, 1993.
B. Monien and R. Schulz. Four approximation algorithms for the feedback vertex set problem. In Proc. of the 7th Conference on Graph Theoretic Concepts of Computer Science, pages 315–326, 1981.
B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica, 22:115–123, 1985.
C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425–440, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bafna, V., Berman, P., Fujito, T. (1995). Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015417
Download citation
DOI: https://doi.org/10.1007/BFb0015417
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive