Publisher
Springer Science and Business Media LLC
Reference38 articles.
1. Arthur, D., & Vassilvitskii, S. (2007). K-means++: the advantages of careful seeding. SODA (pp. 1027-1035). SIAM.
2. Balcan, M., Ehrlich, S., & Liang, Y. (2013). Distributed k-means and k-median clustering on general communication topologies. NIPS (pp. 1995-2003).
3. Barger, A., & Feldman, D. (2020). Deterministic coresets for k-means of big sparse data. Algorithms, 13(4), 92.
4. Becchetti, L., Bury, M., Cohen-Addad, V., Grandoni, F., & Schwiegelshohn, C. (2019). Oblivious dimension reduction for k-means: Beyond subspaces and the Johnson-Lindenstrauss lemma. STOC (pp. 1039-1050). ACM.
5. Braverman, V., Jiang, S. H., Krauthgamer, R., & Wu, X. (2021). Coresets for clustering in excluded-minor graphs and beyond. SODA (pp. 2679-2696). SIAM.