Author:
Marathe Madhav V.,Ravi R.,Sundaram R.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. E. M. Arkin, S. P. Fekete, J. S. B. Mitchell and C. D. Piatko, “Optimal Covering Tour Problems,” Proceedings of the 5th International Symposium on Algorithms and Computation (1994).
2. E. M. Arkin and R. Hassin, “Approximation algorithms for the geometric covering salesman problem,” Technical Report #968, School of OR&IE, Cornell University, July 1991. (To appear in Discrete Applied Mathematics.
3. A. Agrawal, P. Klein and R. Ravi, “When trees collide: an approximation problem for the generalized Steiner problem on networks,” SIAM Journal on Computing, vol. 24, pp. 440–456(1995).
4. A. Blum, R. Ravi and S. Vempala, “A constant-factor approximation algorithm for the k-MST problem,” To appear in the Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (1996).
5. P. M. Camerini, and G. Galbiati, “The bounded path problem,” SIAM Journal of Algebraic and Discrete Methods, vol. 3, no. 4, pp. 474–484 (1982).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献