1. V. Bafna, P. Berman, T. Fujito, Constant ratio approximation of the weighted feedback vertex set problem for undirected graphs, in: J. Staples, P. Eades, N. Katoh, A. Moffat (Eds.), ISAAC ’95 Algorithms and Computation, number 1004 in Lecture Notes in Computer Science, Springer, Berlin, 1995, pp. 142–151.
2. R. Bar-Yehuda, D. Geiger, J. Naor, R.M. Roth, Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 344–354.
3. A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, in: Proc. 10th Conf. on Uncertainty in Artificial Intelligence, 1994, pp. 60–68. Update: A. Becker, D. Geiger: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem, Artificial Intelligence 83 (1996), 167–188.
4. G. Even, J. Naor, B. Schieber, L. Zosin, Approximating minimum subset feedback sets in undirected graphs with applications, in: Proc. 4th Israel Symp. on Theory of Computing and Systems, 1996, pp. 78–88.
5. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.