Author:
Cheriyan Joseph,Salavatipour Mohammad R.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference25 articles.
1. S. Arora and C. Lund, Hardness of approximations, inApproximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS, Boston, MA, 1996.
2. A. Baveja and A. Srinivasan, Approximation algorithms for disjoint paths and related routing and packing problems,Mathematics of Operations Research 25:255–280, 2000. Earlier version in FOCS 1997.
3. R. Carr and S. Vempala, Randomized metarounding,Random Structures and Algorithms, 20:343–352, 2002. Earlier version in STOC 2000.
4. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, Approximation algorithms for directed Steiner problem,Journal of Algorithms 33(1):73–91, 1999. Earlier version in SODA 1998.
5. M. Charikar, J. Naor, and B. Schieber, Resource optimization in QoS multicast routing of real-time multimedia,Proc. 19thAnnual IEEE INFOCOM, pp. 1518–1527, 2000.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献