Record
- Authors
- Aloise, D.; Deshpande, A.; Hansen, P.; Popat, P.
- Year
- 2009
- Title
- NP-hardness of Euclidean sum-of-squares clustering
- Published in
- Machine Learning
- Volume
- 75 (2)
- Pages
- 245–248
- Type
- Journal article
- Our note
- none yet
- Verification
- matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W2086959852 · DOI 10.1007/s10994-009-5103-0 - Id
aloise-2009-np-hardness-euclidean-sum-squares-clustering
Cited on
- The k-means Algorithm read status: not stated
As cited
The pages cite this work in one form.
-
Aloise, D., Deshpande, A., Hansen, P., and Popat, P. (2009). NP-hardness of Euclidean sum-of-squares clustering. Machine Learning, 75(2), 245–248.
BibLaTeX
@article{aloise-2009-np-hardness-euclidean-sum-squares-clustering,
author = {Aloise, D. and Deshpande, A. and Hansen, P. and Popat, P.},
title = {{NP-hardness of Euclidean sum-of-squares clustering}},
journaltitle = {Machine Learning},
date = {2009},
volume = {75},
number = {2},
pages = {245--248}
}