1. V. Bafna, P. Berman, and T. lijito, Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs, in ISAAC95, Algorithms and Computation,J. Staples, P. Eades, N. Katoh and A. Moffat Eds., Lecture Notes in Computer Science Vol.1004, Springer-Verlag (1995) pp. 142–151.
2. 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, A preliminary version of this paper appeared in the Proc. of the 5t
h
Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 344–354, (1994) and subsequently published in SIAM J. Comput. Vol. 27 No. 4 (1998) pp. 942–959.
3. A. Becker, and D. Geiger, Approximation algorithm for the loop cut-set problem, in Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence Morgan Kaufman (1994) pp. 60–68.
4. A. Becker, and D. Geiger, Optimization of Pearl’s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem, Artificial Intelligence Vol. 83 (1996) pp. 167–188.
5. J. A. Bondy, G. Hopkins, and W. Staton, Lower bounds for induced forests in cubic graphs, Gonad. Math. Bull. Vol. 30 (1987) pp. 193–199.