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

Journal

Pattern Recognition Letters
ISSN: 0167-8655

Output data

Year: 2017, Volume: 97, Pages: 44-45 Pages count : 2 DOI: 10.1016/j.patrec.2017.05.033

Tags

Balanced clustering; Complexity; Sum-of-squares

Authors

Pyatkin Artem ^1,2 , Aloise Daniel ³ , Mladenović Nenad ⁴

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University
3	École Polytechnique de Montréal
4	Mathematical Institute, Serbian Academy of Science and Arts

Pyatkin A. , Aloise D. , Mladenović N.
NP-Hardness of balanced minimum sum-of-squares clustering
Pattern Recognition Letters. 2017. V.97. P.44-45. DOI: 10.1016/j.patrec.2017.05.033 WOS Scopus OpenAlex