Author:
Even G.,Garg N.,Könemann J.,Ravi R.,Sinha A.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Arkin, E., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems (2003) (manuscript)
2. Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum k-clustering in metric spaces. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 11–20 (2001)
3. Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 1–10 (2001)
4. Chudak, F., Shmoys, D.: Improved approximation algorithms for a capacitated facility location problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875–876 (1999)
5. Diestel, R.: Graph Theory. Springer, Berlin (2000)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献