The planar k-means problem is NP-hard.
Meena MahajanPrajakta NimbhorkarKasturi R. VaradarajanPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- np hard
- k means
- clustering algorithm
- special case
- optimal solution
- np hardness
- linear programming
- scheduling problem
- clustering method
- unsupervised clustering
- approximation algorithms
- np complete
- spectral clustering
- data clustering
- self organizing maps
- computational complexity
- integer programming
- minimum cost
- cluster analysis
- ground plane
- hierarchical clustering
- remains np hard
- document clustering
- decision problems
- closely related
- lower bound
- greedy heuristic
- fuzzy c means
- worst case
- pairwise
- cluster centers
- clustering quality
- image sequences
- planar graphs
- geometric shapes
- fuzzy clustering algorithm
- polynomial time approximation
- neural network