Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 106–113, 1998.
2. M. L. Balinksi. On finding integer solutions to linear programs. In Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems, pages 225–248. IBM, 1966.
3. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility loca-tion and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 378–388, 1999.
4. M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys. A constant-factor approximation algorithms for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1–10, 1999.
5. Lect Notes Comput Sci;F. A. Chudak,1998
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献