Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bar-Yehuda, R., Even, S.: A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)
2. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)
3. Crescenzi, P., Kann, V.: A compendium of NP optimization problems (1995),
http://www.nada.kth.se/theory/problemlist.html
4. Duh, R., Fürer, M.: Approximation of k-set cover by semi local optimization. In: Proc. STOC 1997, pp. 256–264 (1997)
5. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45, 634–652 (1998)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献