{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:25:57Z","timestamp":1742959557046,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_26","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"422-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation and Complexity of\u00a0the\u00a0Capacitated Geometric Median Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4692-1994","authenticated-orcid":false,"given":"Vladimir","family":"Shenmaier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"26_CR1","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. Combinatorial and Computational Geometry, MSRI Publications 52, 1\u201330 (2005). http:\/\/library.msri.org\/books\/Book52\/files\/01agar.pdf"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding $$k$$ points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991). https:\/\/doi.org\/10.1016\/0196-6774(91)90022-Q","journal-title":"J. Algorithms"},{"key":"26_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19790590233","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). https:\/\/doi.org\/10.1002\/zamm.19790590233"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3(2), 177\u2013191 (1988). https:\/\/doi.org\/10.1007\/BF02187906","journal-title":"Discrete Comput. Geom."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"B\u01cedoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC 2002), pp. 250\u2013257 (2002). https:\/\/doi.org\/10.1145\/509907.509947","DOI":"10.1145\/509907.509947"},{"issue":"1","key":"26_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). https:\/\/doi.org\/10.1007\/s00224-017-9820-7","journal-title":"Theory Comput. Syst."},{"key":"26_CR7","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 642\u2013651 (2001). https:\/\/dl.acm.org\/doi\/10.5555\/365411.365555"},{"key":"26_CR8","unstructured":"Chen, K.: A constant factor approximation algorithm for $$k$$-median clustering with outliers. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 826\u2013835 (2008). https:\/\/dl.acm.org\/doi\/10.5555\/1347082.1347173"},{"issue":"3","key":"26_CR9","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(3), 923\u2013947 (2009). https:\/\/doi.org\/10.1137\/070699007","journal-title":"SIAM J. Comput."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Lee, Y.T., Miller, G., Pachocki, J., Sidford, A.: Geometric median in nearly linear time. arXiv:1606.05225 [cs.DS] (2016). https:\/\/arxiv.org\/abs\/1606.05225","DOI":"10.1145\/2897518.2897647"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Feldmann, A.E., Saulpic, D.: Near-linear time approximations schemes for clustering in doubling metrics. In: Proceedings of the 60th Symposium on Foundations of Computer Science (FOCS 2019), pp. 540\u2013559 (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00041","DOI":"10.1109\/FOCS.2019.00041"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1287\/ijoc.4.4.418","volume":"4","author":"H ElGindy","year":"1992","unstructured":"ElGindy, H., Keil, J.M.: Efficient algorithms for the capacitated $$1$$-median problem. ORSA J. Comput. 4(4), 418\u2013425 (1992). https:\/\/doi.org\/10.1287\/ijoc.4.4.418","journal-title":"ORSA J. Comput."},{"issue":"4","key":"26_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00189-7","volume":"79","author":"U Feige","year":"2001","unstructured":"Feige, U., Karpinski, M., Langberg, M.: A note on approximating max-bisection on regular graphs. Inf. Proc. Letters 79(4), 181\u2013188 (2001). https:\/\/doi.org\/10.1016\/S0020-0190(00)00189-7","journal-title":"Inf. Proc. Letters"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based $$k$$-clustering. In: Proceedings of the 10th ACM Symposium on Computational Geometry, pp. 332\u2013339 (1994). https:\/\/doi.org\/10.1145\/177424.178042","DOI":"10.1145\/177424.178042"},{"issue":"3","key":"26_CR15","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). https:\/\/doi.org\/10.1134\/S1990478911030069","journal-title":"J. Appl. Industr. Math."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Li, S., Sandeep, S.: Constant approximation for $$k$$-median and $$k$$-means with outliers via iterative rounding. In: Proceedings of the 50th ACM Symposium on Theory of Computing (STOC 2018), pp. 646\u2013659 (2018). https:\/\/doi.org\/10.1145\/3188745.3188882","DOI":"10.1145\/3188745.3188882"},{"issue":"2","key":"26_CR17","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). https:\/\/doi.org\/10.1145\/1667053.1667054","journal-title":"J. ACM."},{"issue":"6","key":"26_CR18","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1982.1676031","volume":"31","author":"DT Lee","year":"1982","unstructured":"Lee, D.T.: On $$k$$-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput. 31(6), 478\u2013487 (1982). https:\/\/doi.org\/10.1109\/TC.1982.1676031","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-0000(93)90041-T","volume":"47","author":"K Mulmuley","year":"1993","unstructured":"Mulmuley, K.: Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements. J. Comp. Syst. Sci. 47(3), 437\u2013458 (1993). https:\/\/doi.org\/10.1016\/0022-0000(93)90041-T","journal-title":"J. Comp. Syst. Sci."},{"issue":"3","key":"26_CR20","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). https:\/\/doi.org\/10.1134\/S1990478912030131","journal-title":"J. Appl. Industr. Math."},{"issue":"3","key":"26_CR21","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). https:\/\/doi.org\/10.1134\/S1990478913030186","journal-title":"J. Appl. Industr. Math."},{"key":"26_CR22","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. European J. Comb. 48, 81\u201387 (2015). https:\/\/doi.org\/10.1016\/j.ejc.2015.02.011","journal-title":"European J. Comb."},{"issue":"4","key":"26_CR23","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1134\/S199047891604013X","volume":"10","author":"VV Shenmaier","year":"2016","unstructured":"Shenmaier, V.V.: Solving some vector subset problems by Voronoi diagrams. J. Appl. Industr. Math. 10(4), 560\u2013566 (2016). https:\/\/doi.org\/10.1134\/S199047891604013X","journal-title":"J. Appl. Industr. Math."},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-37599-7_24","volume-title":"Machine Learning, Optimization, and Data Science","author":"VV Shenmaier","year":"2019","unstructured":"Shenmaier, V.V.: A structural theorem for center-based clustering in high-dimensional Euclidean space. In: Nicosia, G., Pardalos, P., Umeton, R., Giuffrida, G., Sciacca, V. (eds.) LOD 2019. LNCS, vol. 11943, pp. 284\u2013295. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37599-7_24"},{"key":"26_CR25","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-030-58657-7_10","volume-title":"Mathematical Optimization Theory and Operations Research","author":"VV Shenmaier","year":"2020","unstructured":"Shenmaier, V.V.: Some estimates on the discretization of geometric center-based problems in high dimensions. In: Kochetov, Y., Bykadorov, I., Gruzdeva, T. (eds.) MOTOR 2020. CCIS, vol. 1275, pp. 88\u2013101. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58657-7_10"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:24:33Z","timestamp":1623972273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"68","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":"28","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":"3.1","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":"9.2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}