A Nearly Tight Analysis of Greedy k-means++

Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek. A Nearly Tight Analysis of Greedy k-means++. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 1012-1070, SIAM, 2023. [doi]

Abstract

Abstract is missing.