Author:
Chekuri Chandra,Kumar Amit
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Ageev, A., Sviridenko, M.: Pipage Rounding: a New Method of Constructing Algorithms with Proven Performance Guarantee. J. of Combinatorial Optimization (to appear)
2. Arkin, E., Mitchell, J., Narasimhan, G.: Resource-constrained geometric network optimization. In: Proceedings of SoCG (1998)
3. S. Arora and G. Karakostas. A 2 + ε approximation for the k-MST problem. In Proceedings of SODA, 2000.
4. Lecture Notes in Computer Science;R. Bar-Yehuda,2003
5. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of STOC (1994)
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献