Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. A linear time approximation algorithm for approximating the weighted vertex cover;Bar-Yehuda;Journal of Algorithms,1981
2. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Annals of Discrete Mathematics,1985
3. A modification of the greedy algorithm for vertex cover;Clarkson;Information Processing Letters,1983
4. R. Gandhi, S. Khuller, A. Srinivasan, Approximation algorithms for partial covering problems, in: Proceedings of the 11th International Colloquium on Automata, Languages, and Programming (ICALP'01), 2001
5. S. Guha, R. Hassin, S. Khuller, E. Or, Capacitated vertex covering with applications, in: Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA'02), 2002, pp. 858–865
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rounding to an integral program;Operations Research Letters;2008-05