Near-Optimal Bounds for Parameterized Euclidean k-means

Vincent Cohen-Addad, Karthik C. S., David Saulpic +1

The $k$-means problem is a classic objective for modeling clustering in a metric space. Given a set of points in a metric space, the goal is to find $k$ representative points so as…