Journal
MACHINE LEARNING
Volume 75, Issue 2, Pages 245-248Publisher
SPRINGER
DOI: 10.1007/s10994-009-5103-0
Keywords
Clustering; Sum-of-squares; Complexity
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
