Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
2. On approximation properties of the independent set problem for low degree graphs;Berman;Theory Comput. Systems,1999
3. M. Chlebík, J. Chlebíkova´, On approximation hardness of the minimum 2SAT- DELETION problem, Proc. 29th Int. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 3153, 2004, pp. 263–273.
4. Improved non-approximability results for minimum vertex cover with density constraints;Clementi;Theoret. Comput. Sci.,1999
5. I. Dinur, S. Safra, The importance of being biased, Proc. 34th Annu. ACM Symp. on Theory of Computing, 2002, pp. 33–42.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献