Author:
Koufogiannakis Christos,Young Neal E.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference59 articles.
1. Awerbuch B., Berger B., Cowen L., Peleg D.: Low-diameter graph decomposition is in NC. Random Struct. Algorithms 5(3), 441–452 (1994)
2. Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: On k-column sparse packing programs. In: Proceedings of MPS Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 369–382 (2010)
3. Bar-Yehuda R., Bendel K., Freund A., Rawitz D.: Local ratio: a unified framework for approximation algorithms. ACM Comput. Surv. 36(4), 422–463 (2004)
4. Bar-Yehuda R., Even S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198–203 (1981)
5. Bar-Yehuda R., Even S.: A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discret. Math. 25(27–46), 50 (1985)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献