Author:
Kumar Amit,Sabharwal Yogish,Sen Sandeep
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 2–11 (1996)
2. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 106–113 (1998)
3. Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 250–257 (2002)
4. Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximating algorithms for NP-Hard problems, pp. 296–345. PWS Publishing Company (1997)
5. Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the Web. In: Proc. of 6th International World Wide Web Conference, pp. 391–404 (1997)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献