1. Bar-Yehuda R., Geiger D., Naor J., and Roth R. Approximation algorithms for the vertex feedback set problems with applications to constraint satisfaction and Bayesian inference. In proc. of the 5th Annual ACM-Siam Symposium On Discrete Algorithms, Arlington, Virginia, January 1994.
2. Berman P. Pennsylvania state university. Personal communication. February 1994.
3. A greedy heuristic for the setcovering problem;Chvatal;Mathematics of operations research,1979
4. A modification of the greedy algorithm for vertex cover;Clarkson;Information Processing Letters,1983
5. Introduction to algorithms;Cormen,1990