The Planar k-Means Problem is NP-Hard.
Meena MahajanPrajakta NimbhorkarKasturi R. VaradarajanPublished in: WALCOM (2009)
Keyphrases
- np hard
- k means
- clustering algorithm
- optimal solution
- special case
- approximation algorithms
- scheduling problem
- np complete
- data clustering
- closely related
- linear programming
- np hardness
- lower bound
- remains np hard
- clustering method
- cluster analysis
- spectral clustering
- computational complexity
- unsupervised clustering
- text clustering
- document clustering
- worst case
- self organizing maps
- minimum cost
- line drawings
- hierarchical clustering
- knapsack problem
- integer programming
- branch and bound algorithm
- constraint satisfaction problems
- neural network
- gallium arsenide
- expectation maximization
- decision problems
- cluster centers
- greedy heuristic
- set cover
- approximation ratio
- parallel manipulator
- initial cluster centers
- rough k means