no code implementations • 16 Jul 2022 • Christoph Grunau, Ahmet Alper Özüdoğru, Václav Rozhoň, Jakub Tětek
In their seminal work, Arthur and Vassilvitskii [SODA 2007] asked about the guarantees for its following \emph{greedy} variant: in every step, we sample $\ell$ candidate centers instead of one and then pick the one that minimizes the new cost.
