New paper proves near-optimal lower bounds for approximating Euclidean k-means under almost ETH
A new arXiv paper establishes almost optimal lower bounds for approximating the Euclidean k-means problem, assuming almost ETH. The result limits how well k-means clustering can be approximated in polynomial time.
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-11-13 05:00 · arXiv stat.ML
Almost Optimal Lower Bounds under Almost ETH for Approximating Euclidean k-means