Резултати

eNauka >  Results >  NP-Hardness of balanced minimum sum-of-squares clustering
Title: NP-Hardness of balanced minimum sum-of-squares clustering
Authors: Pyatkin, Artem; Aloise, Daniel; Mladenović, Nenad  
Issue Date: 2017
Publication: Pattern Recognition Letters
ISSN: 0167-8655 Pattern Recognition Letters Search Idenfier
Publisher: Elsevier
Type: Article
Collation: vol. 97 str. 44-45
DOI: 10.1016/j.patrec.2017.05.033
WoS-ID: 000411765800007
Scopus-ID: 2-s2.0-85021763075
URI: http://researchrepository.mi.sanu.ac.rs/handle/123456789/2391
https://enauka.gov.rs/handle/123456789/579319
Project: RFBR, projects 16-07-00168 and 15-01-00462
RSF grant 14-41-00039
CNPq/Brazil grants 308887/2014-0 and 400350/2014-9
M-category: 
22M22

11
SCOPUSTM
9
OpenCitations
9
WEB OF SCIENCETM
Altmetric
Dimensions
Unpaywall

Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.