NP-hardness of Euclidean sum-of-squares clustering
- First Online:
- Cite this article as:
- Aloise, D., Deshpande, A., Hansen, P. et al. Mach Learn (2009) 75: 245. doi:10.1007/s10994-009-5103-0
A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9–33, 2004), is not valid. An alternate short proof is provided.
KeywordsClustering Sum-of-squares Complexity
Download to read the full article text
© Springer Science+Business Media, LLC 2009