Author:
Hassin Refael,Segev Danny
Publisher
Springer Berlin Heidelberg
Reference9 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. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
3. Chuzhoy, J., Naor, J.: Covering problems with hard capacities. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, pp. 481–489 (2002)
4. Dinur, I., Safra, S.: The importance of being biased. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 33–42 (2002)
5. Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. Journal of Algorithms 48, 257–270 (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the multi-radius cover problem;Information Processing Letters;2006-09
2. Rounding to an Integral Program;Experimental and Efficient Algorithms;2005