{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:56:16Z","timestamp":1743029776125,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_9","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"119-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Fair k-Min-Sum-Radii in\u00a0Euclidean Space"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9395-6711","authenticated-orcid":false,"given":"Lukas","family":"Drexler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9109-3107","authenticated-orcid":false,"given":"Annika","family":"Hennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7556-3445","authenticated-orcid":false,"given":"Abhiruk","family":"Lahiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4856-3905","authenticated-orcid":false,"given":"Melanie","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4583-7288","authenticated-orcid":false,"given":"Julian","family":"Wargalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Ahmadian, S., Swamy, C.: Approximation algorithms for clustering problems with lower bounds and outliers. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), vol. 55, pp. 69:1\u201369:15 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.69","key":"9_CR1","DOI":"10.4230\/LIPIcs.ICALP.2016.69"},{"doi-asserted-by":"publisher","unstructured":"Arutyunova, A., Schmidt, M.: Achieving anonymity via weak lower bound constraints for k-median and k-means. In: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 187, pp. 7:1\u20137:17 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.7","key":"9_CR2","DOI":"10.4230\/LIPIcs.STACS.2021.7"},{"doi-asserted-by":"publisher","unstructured":"Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 250\u2013257. ACM (2002). https:\/\/doi.org\/10.1145\/509907.509947","key":"9_CR3","DOI":"10.1145\/509907.509947"},{"unstructured":"Bandyapadhyay, S., Lochet, W., Saurabh, S.: FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii. In: 39th International Symposium on Computational Geometry (SoCG) (2023, to appear). https:\/\/doi.org\/10.48550\/arXiv.2303.07923","key":"9_CR4"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00453-014-9907-3","volume":"73","author":"B Behsaz","year":"2015","unstructured":"Behsaz, B., Salavatipour, M.R.: On minimum sum of radii and diameters clustering. Algorithmica 73(1), 143\u2013165 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9907-3","journal-title":"Algorithmica"},{"unstructured":"Bera, S.K., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS 2019), pp. 4955\u20134966 (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/fc192b0c0d270dbf41870a63a8c76c2f-Abstract.html","key":"9_CR6"},{"doi-asserted-by":"publisher","unstructured":"Bercea, I.O., et al.: On the cost of essentially fair clusterings. In: Proceedings of APPROX\/RANDOM 2019, vol. 145, pp. 18:1\u201318:22 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2019.18","key":"9_CR7","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2019.18"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11561071_42","volume-title":"Algorithms \u2013 ESA 2005","author":"V Bil\u00f2","year":"2005","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 460\u2013471. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_42"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.orl.2021.08.011","volume":"49","author":"M B\u00f6hm","year":"2021","unstructured":"B\u00f6hm, M., Fazzone, A., Leonardi, S., Menghini, C., Schwiegelshohn, C.: Algorithms for fair k-clustering with multiple protected attributes. Oper. Res. Lett. 49(5), 787\u2013789 (2021)","journal-title":"Oper. Res. Lett."},{"unstructured":"B\u00f6hm, M., Fazzone, A., Leonardi, S., Schwiegelshohn, C.: Fair clustering with multiple colors. arXiv preprint arXiv:2002.07892 (2020)","key":"9_CR10"},{"doi-asserted-by":"crossref","unstructured":"Capoyleas, V., Rote, G., Woeginger, G.: Geometric clusterings. J. Algorithms 12(2), 341\u2013356 (1991). https:\/\/www.sciencedirect.com\/science\/article\/pii\/019667749190007L","key":"9_CR11","DOI":"10.1016\/0196-6774(91)90007-L"},{"unstructured":"Caton, S., Haas, C.: Fairness in machine learning: a survey. arXiv preprint arXiv:2010.04053 (2020)","key":"9_CR12"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jcss.2003.07.014","volume":"68","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. J. Comput. Syst. Sci. 68(2), 417\u2013441 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2003.07.014","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"130698","DOI":"10.1109\/ACCESS.2021.3114099","volume":"9","author":"A Chhabra","year":"2021","unstructured":"Chhabra, A., Masalkovait\u0117, K., Mohapatra, P.: An overview of fairness in clustering. IEEE Access 9, 130698\u2013130720 (2021)","journal-title":"IEEE Access"},{"unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Advances in Neural Information Processing Systems, vol. 30 (2017)","key":"9_CR15"},{"doi-asserted-by":"publisher","unstructured":"Friggstad, Z., Jamshidian, M.: Improved polynomial-time approximations for clustering with minimum sum of radii or diameters. In: 30th Annual European Symposium on Algorithms (ESA), vol. 244, pp. 56:1\u201356:14 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.56","key":"9_CR16","DOI":"10.4230\/LIPIcs.ESA.2022.56"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00453-009-9282-7","volume":"57","author":"M Gibson","year":"2010","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I.A., Varadarajan, K.R.: On metric clustering to minimize the sum of radii. Algorithmica 57(3), 484\u2013498 (2010). https:\/\/doi.org\/10.1007\/s00453-009-9282-7","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/100798144","volume":"41","author":"M Gibson","year":"2012","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I.A., Varadarajan, K.R.: On clustering to minimize the sum of radii. SIAM J. Comput. 41(1), 47\u201360 (2012). https:\/\/doi.org\/10.1137\/100798144","journal-title":"SIAM J. Comput."},{"key":"9_CR19","first-page":"14509","volume":"33","author":"E Harb","year":"2020","unstructured":"Harb, E., Lam, H.S.: KFC: a scalable approximation algorithm for $$ k $$-center fair clustering. Adv. Neural. Inf. Process. Syst. 33, 14509\u201314519 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"doi-asserted-by":"publisher","unstructured":"Henzinger, M., Leniowski, D., Mathieu, C.: Dynamic clustering to minimize the sum of radii. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA), vol. 87, pp. 48:1\u201348:10 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.48","key":"9_CR20","DOI":"10.4230\/LIPIcs.ESA.2017.48"},{"doi-asserted-by":"publisher","unstructured":"Inamdar, T., Varadarajan, K.R.: Capacitated sum-of-radii clustering: an FPT approximation. In: Proceedings of the 28th Annual European Symposium on Algorithms (ESA), vol. 173, pp. 62:1\u201362:17 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.62","key":"9_CR21","DOI":"10.4230\/LIPIcs.ESA.2020.62"},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489\u2013501 (2005). https:\/\/doi.org\/10.1016\/j.comnet.2004.08.012","journal-title":"Comput. Netw."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/11940128_58","volume-title":"Algorithms and Computation","author":"G Proietti","year":"2006","unstructured":"Proietti, G., Widmayer, P.: Partitioning the nodes of a graph to minimize the sum of subgraph radii. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 578\u2013587. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11940128_58"},{"doi-asserted-by":"publisher","unstructured":"R\u00f6sner, C., Schmidt, M.: Privacy preserving clustering with constraints. In: 45th International Colloquium on Automata, Languages, and Programming, (ICALP) 2018, vol. 107, pp. 96:1\u201396:14 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.96. arXiv:1802.02497","key":"9_CR24","DOI":"10.4230\/LIPIcs.ICALP.2018.96"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1137\/070690419","volume":"19","author":"EA Yildirim","year":"2008","unstructured":"Yildirim, E.A.: Two algorithms for the minimum enclosing ball problem. SIAM J. Optim. 19(3), 1368\u20131391 (2008). https:\/\/doi.org\/10.1137\/070690419","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:03:28Z","timestamp":1703142208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","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":"43","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":"16","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":"37% - 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.05","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":"7.7","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)"}}]}}