Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, N. Papakostantinou, The complexity of the traveling repairman problem, RAIRO Informatique Theorique et Applications 20 (1986), 79–87.
2. S. Arora, G. Karakostas, Approximation schemes for minimum latency problems, Proceedings of the 31st ACM Symposium on Theory of Computing (Atlanta, 1999), 688–693.
3. S. Arora, G. Karakostas, A 2+ε approximation for the k-MST problem, Proceedings of the 11th SIAM Symposium on Discrete Algorithms (SODA) (San Francisco, 2000), 754–759.
4. Lect Notes Comput Sci;G. Ausiello,2000
5. I. Averbakh, O. Berman, Sales-delivery man problems on treelike networks, Networks 25 (1995), 45–58.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献