Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bar-Yehuda, R. and Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25 (1985) 27–46
2. Berman, P. and Fujito, T.: On approximation properties of the independent set problem for low degree graphs. Theory Comput. Systems 32 (1999) 115–132
3. Chen, J.: Introduction to Tractability and Approximability of Optimization problems Lecture Notes, Department of Computer Science, Texas A&M University (2000)
4. Chen, J. and Kanj, I. A.: On approximating minimum vertex cover for graphs with perfect matching, Tech. Report, Department of Computer Science, Texas A&M University (2000)
5. Clementi, A. and Trevisan, L.: Improved non-approximability results for minimum vertex cover with density constraints. Theoretical Computer Science 225 (1999) 113–128
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献