"NP-hardness of Euclidean sum-of-squares clustering."

Daniel Aloise et al. (2009)

> Home

Details and statistics

DOI: 10.1007/S10994-009-5103-0

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ml/AloiseDHP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ml/AloiseDHP09
Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat:
NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2): 245-248 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.