litlas
Log inCreate account

NP-hardness of Euclidean sum-of-squares clustering

Authors: Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat - Machine Learning 2008 cited by 863

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.

NP-hardness of Euclidean sum-of-squares clustering | Litlas