Journal ArticleOPEN ACCESS

NP-hardness of Euclidean sum-of-squares clustering

Machine Learning (2009) 75(2) 245-248
DOI: 10.1007/s10994-009-5103-0
803Citations
Citations of this article
228Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009). NP-hardness of Euclidean sum-of-squares clustering. Machine Learning, 75(2), 245–248. https://doi.org/10.1007/s10994-009-5103-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free