NP-hardness of Euclidean sum-of-squares clustering

Daniel Aloise, Amit Deshpande, Pierre Hansen and Preyas Popat

Article (2009)

An external link is available for this item

Department:	Department of Computer Engineering and Software Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/52230/
Journal Title:	Machine Learning (vol. 75, no. 2)
Publisher:	Springer
DOI:	10.1007/s10994-009-5103-0
Official URL:	https://doi.org/10.1007/s10994-009-5103-0
Date Deposited:	18 Apr 2023 15:14
Last Modified:	22 Apr 2025 09:48

Cite in APA 7:	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
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only