NP-Hardness of Euclidean Sum-of-Squares Clustering
Cite
Text
Aloise et al. "NP-Hardness of Euclidean Sum-of-Squares Clustering." Machine Learning, 2009. doi:10.1007/S10994-009-5103-0Markdown
[Aloise et al. "NP-Hardness of Euclidean Sum-of-Squares Clustering." Machine Learning, 2009.](https://mlanthology.org/mlj/2009/aloise2009mlj-nphardness/) doi:10.1007/S10994-009-5103-0BibTeX
@article{aloise2009mlj-nphardness,
title = {{NP-Hardness of Euclidean Sum-of-Squares Clustering}},
author = {Aloise, Daniel and Deshpande, Amit and Hansen, Pierre and Popat, Preyas},
journal = {Machine Learning},
year = {2009},
pages = {245-248},
doi = {10.1007/S10994-009-5103-0},
volume = {75},
url = {https://mlanthology.org/mlj/2009/aloise2009mlj-nphardness/}
}