1 paper
Monika Henzinger, David Saulpic, Leonhard Sidl
For a set of points in Rd, the Euclidean k-means problems consists of finding k centers such that the sum of distances squared from each data point to its closest c…