1. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev, Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), May 2005, Baltimore, MD, USA.
2. Complexity and Approximation;Ausiello,1999
3. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
4. P. Berman, M. Karpinski, Improved approximation lower bounds on small occurrence optimization, ECCC Report TR03-08, 2003.
5. J. Chen, I.A. Kanj, On approximating minimum vertex cover for graphs with perfect matching, Proceedings of the 11st ISAAC, Taipei, Taiwan, Lecture Notes in Computer Science, vol. 1969, Springer, Berlin, 2000, pp. 132–143.