A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Polynomial time approximation schemes for geometric k-clustering
Proceedings 41st Annual Symposium on Foundations of Computer Science
We deal with the problem of clustering data points. Given n points in a larger set (for example, R d ) endowed with a distance function (for example, L 2 distance), we would like to partition the data set into k disjoint clusters, each with a \cluster center", so as to minimize the sum over all data points of the distance between the point and the center of the cluster containing the point. The problem is provably NP-hard in some high dimensional geometric settings, even for k = 2. We give
doi:10.1109/sfcs.2000.892123
dblp:conf/focs/OstrovskyR00
fatcat:crozde7xvzhdzavwwy4vod6wlu