Beyond the First Hit: Towards Tight Guarantees for k-means++
cs.DS, cs.LG
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Improved Guarantees for k-means++ and k-means++ Parallel
- Randomizing the Number of Centers in k-means++
- Noisy k-means++ is Not too Noisy
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time