{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:07:59Z","timestamp":1723756079553},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002261","name":"RFBR","doi-asserted-by":"publisher","award":["16-07-00168","15-01-00462"],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1016\/j.patrec.2017.05.033","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T12:11:46Z","timestamp":1498824706000},"page":"44-45","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["NP-Hardness of balanced minimum sum-of-squares clustering"],"prefix":"10.1016","volume":"97","author":[{"given":"Artem","family":"Pyatkin","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Aloise","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2017.05.033_bib0001","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","article-title":"NP-hardness of Euclidean sum-of-squares clustering","volume":"75","author":"Aloise","year":"2009","journal-title":"Mach. Learn."},{"issue":"1","key":"10.1016\/j.patrec.2017.05.033_bib0002","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-2012-644","article-title":"Size constrained distance clustering: separation properties and some complexity results","volume":"115","author":"Bertoni","year":"2012","journal-title":"Fundam. Inform."},{"issue":"1","key":"10.1016\/j.patrec.2017.05.033_bib0003","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1057\/palgrave.jors.2601775","article-title":"Design of balanced MBA student teams","volume":"56","author":"Desrosiers","year":"2005","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/j.patrec.2017.05.033_bib0004","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"9","key":"10.1016\/j.patrec.2017.05.033_bib0005","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","article-title":"New spectral methods for ratio cut partitioning and clustering","volume":"11","author":"Hagen","year":"1992","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"3","key":"10.1016\/j.patrec.2017.05.033_bib0006","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1134\/S096554251603009X","article-title":"On the complexity of some quadratic euclidean 2-clustering problems","volume":"56","author":"Kelmanov","year":"2016","journal-title":"Comput. Math. Math. Phys."},{"key":"10.1016\/j.patrec.2017.05.033_bib0007","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-642-00202-1_24","article-title":"The planar k-means problem is NP-hard","volume":"5431","author":"Mahajan","year":"2009","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/j.patrec.2017.05.033_bib0008","series-title":"Web Services (ICWS), 2015 IEEE International Conference on","first-page":"615","article-title":"SLA-aware tenant placement and dynamic resource provision in saas","author":"Su","year":"2015"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865517301988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865517301988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T10:22:46Z","timestamp":1616235766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865517301988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":8,"alternative-id":["S0167865517301988"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2017.05.033","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"NP-Hardness of balanced minimum sum-of-squares clustering","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patrec.2017.05.033","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}