Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference59 articles.
1. Ackermann, M.R., Blömer, J., Sohler, C.: Clustering for metric and non-metric distance measures. ACM Trans. Algorithms 6(4), 59 (2010)
2. Aggarwal, G., Panigrahy, R., Feder, T., Thomas, D., Kenthapadi, K., Khuller, S., Zhu, A.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49 (2010)
3. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23 (2008)
4. Awasthi, P., Charikar, M., Krishnaswamy, R., Sinop, A.K.: The hardness of approximation of euclidean k-means. In: Proceedings of 31st International Symposium on Computational Geometry (SoCG’15), pp. 754–767 (2015)
5. An, H.-C., Bhaskara, A., Chekuri, C., Gupta, S., Madanand, V., Svensson, O.: Centrality of Trees for Capacitated k-Center, Proc. 7th International Conference Integer Programming and Combinatorial Optimization (IPCO’14), pp. 52-63, (2014)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献