A nearly tight analysis of greedy k-means++

DOI10.1137/1.9781611977554.CH39MaRDI QIDQ6538569zbMATH OpenFDO

Authors Christoph Grunau, Ahmet Alper Özüdoğru, Václav Rozhoň, Jakub Tětek

Publication date 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A nearly tight analysis of greedy \(k\)-means++

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538569)