Author:
Kumar Amit,Sabharwal Yogish
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arora, S., Raghavan, P., Rao, S.: Polynomial time approximation schemes for the Euclidean k-median problem. In: Proceedings of the 30th annual ACM Symposium on Theory of Computing (1998)
2. Arya, V., Garg, N., Khandekar, R., Pandit, V., Meyerson, A., Munagala, K.: Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001)
3. Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (1999)
4. Charikar, M., Guha, S., Tardos, E., Shmoys, D.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (1999)
5. Charikar, M., Naor, J.S., Scheiber, B.: Resource optimization in QoS multicast routing of real-time multimedia. IEEE Transactions on Networking 12(2), 340–348 (2004)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献