NP-Hardness of balanced minimum sum-of-squares clustering › Research Explorer

Novosibirsk State University's Research Portal

NP-Hardness of balanced minimum sum-of-squares clustering

Research output: Contribution to journal › Article › peer-review

Theoretical Cybernetics Section

DOI

https://doi.org/10.1016/j.patrec.2017.05.033
Final published version

Artem Pyatkin
Daniel Aloise
Nenad Mladenović

Original language	English
Pages (from-to)	44-45
Number of pages	2
Journal	Pattern Recognition Letters
Volume	97
DOIs	https://doi.org/10.1016/j.patrec.2017.05.033
Publication status	Published - 1 Oct 2017

Research areas

Balanced clustering, Complexity, Sum-of-squares, COMPLEXITY

OECD FOS+WOS

ID: 9033176