{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:28:24Z","timestamp":1742927304472,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375980"},{"type":"electronic","value":"9783030375997"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37599-7_24","type":"book-chapter","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T09:02:43Z","timestamp":1578042163000},"page":"284-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Structural Theorem for Center-Based Clustering in High-Dimensional Euclidean Space"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Shenmaier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"24_CR1","first-page":"1","volume":"52","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets combinatorial and computational geometry. MSRI 52, 1\u201330 (2005)","journal-title":"MSRI"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadian S., Norouzi-Fard A., Svensson O., Ward J.: Better guarantees for $$k$$-means and Euclidean $$k$$-median by primal-dual algorithms. In: Proceedings of 58th Symposium on Foundations of Computer Science (FOCS 2017), pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"key":"24_CR3","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"B\u01cedoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of 34th ACM Symposium on Theory of Computing (STOC 2002), pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00224-017-9820-7","volume":"62","author":"A Bhattacharya","year":"2018","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster algorithms for the constrained $$k$$-means problem. Theory Comput. Syst. 62(1), 93\u2013115 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/070699007","volume":"39","author":"K Chen","year":"2009","unstructured":"Chen, K.: On coresets for $$k$$-median and $$k$$-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput. 39(1), 923\u2013947 (2009)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.11.2.138","volume":"11","author":"W Cook","year":"1999","unstructured":"Cook, W., Rohe, A.: Computing minimum-weight perfect matchings. INFORMS J. Comput. 11(2), 138\u2013148 (1999)","journal-title":"INFORMS J. Comput."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, D., Monemizadeh, M., Sohler, C.: A PTAS for $$k$$-means clustering based on weak coresets. In: Proceedings of 23rd ACM Symposium on Computational Geometry, pp. 11\u201318 (2007)","DOI":"10.1145\/1247069.1247072"},{"key":"24_CR10","unstructured":"Guruswami, V., Indyk, P.: Embeddings and non-approximability of geometric problems. In: Proceedings of 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 537\u2013538 (2003)"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00453-013-9833-9","volume":"70","author":"R Jaiswal","year":"2014","unstructured":"Jaiswal, R., Kumar, A., Sen, S.: A simple $$D^2$$-sampling based PTAS for $$k$$-means and other clustering problems. Algorithmica 70(1), 22\u201346 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1134\/S1990478911030069","volume":"5","author":"AV Kel\u2019manov","year":"2011","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: NP-completeness of some problems of choosing a vector subset. J. Appl. Industr. Math. 5(3), 352\u2013357 (2011)","journal-title":"J. Appl. Industr. Math."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667054","volume":"57","author":"A Kumar","year":"2010","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM. 57(2), 1\u201332 (2010)","journal-title":"J. ACM."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ipl.2016.11.009","volume":"120","author":"E Lee","year":"2017","unstructured":"Lee, E., Schmidt, M., Wright, J.: Improved and simplified inapproximability for $$k$$-means. Inf. Proc. Lett. 120, 40\u201343 (2017)","journal-title":"Inf. Proc. Lett."},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1134\/S1990478912030131","volume":"6","author":"VV Shenmaier","year":"2012","unstructured":"Shenmaier, V.V.: An approximation scheme for a problem of search for a vector subset. J. Appl. Industr. Math. 6(3), 381\u2013386 (2012)","journal-title":"J. Appl. Industr. Math."},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1134\/S1990478913030186","volume":"7","author":"VV Shenmaier","year":"2013","unstructured":"Shenmaier, V.V.: The problem of a minimal ball enclosing $$k$$ points. J. Appl. Industr. Math. 7(3), 444\u2013448 (2013)","journal-title":"J. Appl. Industr. Math."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ejc.2015.02.011","volume":"48","author":"VV Shenmaier","year":"2015","unstructured":"Shenmaier, V.V.: Complexity and approximation of the smallest $$k$$-enclosing ball problem. Eur. J. Comb. 48, 81\u201387 (2015)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37599-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T10:11:53Z","timestamp":1578046313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37599-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030375980","9783030375997"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37599-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2019.icas.xyz\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"158","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}