Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Wenceslas Fernandez de la VegaMarek KarpinskiClaire KenyonYuval RabaniPublished in: Electron. Colloquium Comput. Complex. (2002)
Keyphrases
- min sum
- approximation schemes
- approximation algorithms
- np hard
- error metrics
- lower bound
- goal programming
- k means
- special case
- clustering method
- clustering algorithm
- data clustering
- computational complexity
- worst case
- image processing
- information theoretic
- numerical methods
- image enhancement
- spectral clustering
- knapsack problem
- minimum cost
- spanning tree
- object recognition
- optimal solution