Abstract
In the k-means problem, we are given a finite set S of points in R m, and integer k ≤ 1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance of each point in S to its nearest center. We show that this well-known problem is NP-hard even for instances in the plane, answering an open question posed by Dasgupta [6]. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2009). The planar k-means problem is NP-hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5431 LNCS, pp. 274–285). https://doi.org/10.1007/978-3-642-00202-1_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
