<  Back to the Polytechnique Montréal portal

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
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: 05 Apr 2024 11:57
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



Repository Staff Only

View Item View Item