Author:
Chakrabarty Deeparnab,Swamy Chaitanya
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Archer, A., Levin, A., Williamson, D.: A faster, better approximation algorithm for the minimum latency problem. SIAM J. Comput. 37(5), 1472–1498 (2008)
2. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The Minimum Latency Problem. In: Proc. 26th STOC, pp. 163–171 (1994)
3. Lecture Notes in Computer Science;J. Byrka,2007
4. Chakrabarty, D., Swamy, C.: Facility Location with Client Latencies: Linear Programming based Techniques for Minimum Latency Problems, http://arxiv.org/abs/1009.2452
5. Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for Group Steiner Trees and k-median. In: Proceedings of the 30th STOC, pp. 114–123 (1998)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献