{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T08:32:07Z","timestamp":1764664327464,"version":"3.46.0"},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","funder":[{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2025,12,31]]},"DOI":"10.1137\/24m1635570","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T08:27:56Z","timestamp":1764664076000},"page":"1456-1488","source":"Crossref","is-referenced-by-count":0,"title":["Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \\(\\boldsymbol{k}\\)-\n                    <scp>means<\/scp>"],"prefix":"10.1137","volume":"54","author":[{"given":"Zachary","family":"Friggstad","sequence":"first","affiliation":[{"name":"Department of Computing Science, University of Alberta, Edmonton, AB, T6G2E8, Canada."}]},{"given":"Kamyar","family":"Khodamoradi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Regina, Regina, SK, S4S 0A2, Canada."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7650-2045","authenticated-orcid":true,"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[{"name":"Department of Computing Science, University of Alberta, Edmonton, AB, T6G2E8, Canada."}]}],"member":"351","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.12.063"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055487"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/140981575"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.116"},{"key":"ref11","first-page":"68:1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome","author":"Balcan M.-F.","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.09.025"},{"key":"ref13","first-page":"526","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013","author":"Bilu Y.","year":"2013"},{"key":"ref14","first-page":"332","volume-title":"Innovations in Computer Science","author":"Bilu Y.","year":"2010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000193"},{"key":"ref20","series-title":"LIPIcs. Leibniz Int. Proc. Inform. 124","volume-title":"10th Innovations in Theoretical Computer Science","author":"Dinur I.","year":"2019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/17M1127181"},{"key":"ref25","series-title":"Ser. Books Math. Sci.","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","edition":"1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.11.009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395117"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-020-00199-3"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90135-0"},{"key":"ref35","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","year":"2001"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T08:27:58Z","timestamp":1764664078000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M1635570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1137\/24M1635570"],"URL":"https:\/\/doi.org\/10.1137\/24m1635570","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]}}}