DMCA
The Planar k-means Problem is NP-hard (2009)
Cached
Download Links
- [www.imsc.res.in]
- [www.imsc.res.in]
- [rangevoting.org]
- DBLP
Other Repositories/Bibliography
by
Meena Mahajan
,
Prajakta Nimbhorkar
,
Kasturi Varadarajan
| Citations: | 45 - 0 self |
BibTeX
@MISC{Mahajan09theplanar,
author = {Meena Mahajan and Prajakta Nimbhorkar and Kasturi Varadarajan},
title = {The Planar k-means Problem is NP-hard },
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the k-means problem, we are given a finite set S of points in ℜ 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 [7].
