1. V. Bafna, P. Berman, T. Fujito, Constant ratio approximations of the feedback vertex set problem for undirected graphs, in: J. Staples P. Eades, N. Katoh, A. Moffat (Eds.), ISAC 95, Algorithms and Computation, 1995, pp. 142–151.
2. R. Bar-Yehuda, D. Geiger, J. Naor, R.M. Roth, Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference, Proceedings of the 5th Annual ACM SIAM Symposium on Discrete Algorithms, 1994, pp. 344–354.
3. A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, in: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, 1994, pp. 60–68.
4. S. Ceria, P. Nobili, A. Sassano, Set covering problem, in: M. Dell'Amico, S. Martello, F. Maffioli (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997, pp. 415–428.
5. A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs;Chudak;Oper. Res. Lett.,1998