Author:
Jothi Raja,Raghavachari Balaji
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. A. Archer, A. Levin, D.P. Williamson, Faster approximation algorithms for the minimum latency problem, in: Proc. 14th Symposium on Discrete Algorithms (SODA), 2003, pp. 88–96
2. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, M. Sudan, The minimum latency problem, in: Proc. 26th Symposium on Theory of Computing (STOC), 1994, pp. 163–171
3. K. Chaudhuri, B. Godfrey, S. Rao, K. Talwar, Paths, tours, and minimum latency tours, in: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 36–45
4. C. Chekuri, A. Kumar, Maximum coverage problem with group budget constraints, in: Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2004, pp. 72–83
5. J. Fakcharoenphol, C. Harrelson, S. Rao, The k-traveling repairman problem, in: Proc. 14th Symposium on Discrete Algorithms (SODA), 2003, pp. 655–664
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献