{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:19:49Z","timestamp":1777339189837,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PNRR CN00000013"],"award-info":[{"award-number":["PNRR CN00000013"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN EXPAND F53D23004360006"],"award-info":[{"award-number":["PRIN EXPAND F53D23004360006"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645568","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"756-767","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Fast and Accurate Fair k-Center Clustering in Doubling Metrics"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2783-0218","authenticated-orcid":false,"given":"Matteo","family":"Ceccarello","sequence":"first","affiliation":[{"name":"University of Padua, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9189-9618","authenticated-orcid":false,"given":"Andrea","family":"Pietracaprina","sequence":"additional","affiliation":[{"name":"University of Padua, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9189-6938","authenticated-orcid":false,"given":"Geppino","family":"Pucci","sequence":"additional","affiliation":[{"name":"University of Padua, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330987"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125644"},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. NeurIPS","author":"Bera Suman Kalyan","year":"2019","unstructured":"Suman Kalyan Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair Algorithms for Clustering. In Proc. NeurIPS. Vancouver, CA, 4955--4966."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512188"},{"key":"e_1_3_2_2_5_1","first-page":"1","article-title":"On the Cost of Essentially Fair Clusterings. In Proc. APPROX-RANDOM (LIPIcs, Vol. 145). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, Cambridge","volume":"18","author":"Bercea Ioana Oriana","year":"2019","unstructured":"Ioana Oriana Bercea, Martin Gro\u00df, Samir Khuller, Aounon Kumar, Clemens R\u00f6 sner, Daniel R. Schmidt, and Melanie Schmidt. 2019. On the Cost of Essentially Fair Clusterings. In Proc. APPROX-RANDOM (LIPIcs, Vol. 145). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, Cambridge, MA USA, 18:1--18:22.","journal-title":"MA USA"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3317315.3317319"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.61"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055541"},{"key":"e_1_3_2_2_9_1","volume-title":"Proc. NIPS. Long Beach, CA USA, 5029--5037","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In Proc. NIPS. Long Beach, CA USA, 5029--5037."},{"key":"e_1_3_2_2_10_1","volume-title":"Proc. ITCS. ACM","author":"Dwork Cynthia","unstructured":"Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard S. Zemel. 2012. Fairness through awareness. In Proc. ITCS. ACM, Cambridge, MA USA, 214--226."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2339840"},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. FOCS. IEEE","author":"Gupta Anupam","unstructured":"Anupam Gupta, Robert Krauthgamer, and James R. Lee. 2003. Bounded Geometries, Fractals, and Low-Distortion Embeddings. In Proc. FOCS. IEEE, Cambridge, MA USA, 534--543."},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. NeurIPS. Virtual Event, 14509--14519","author":"Harb Elfarouk","year":"2020","unstructured":"Elfarouk Harb and Ho Shan Lam. 2020. KFC: A Scalable Approximation Algorithm for k-center Fair Clustering. In Proc. NeurIPS. Virtual Event, 14509--14519."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"S. Im R. Kumar S. Lattanzi B. Moseley and S. Vassilvitskii. 2023. Massive Parallel Computation: Algorithms and Applications. In Foundations and Trends in Optimization. Vol. 5. NOW Publishers Boston-Delft USA-NL 340--417.","DOI":"10.1561\/2400000025"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418295"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA49011.2020.00032"},{"key":"e_1_3_2_2_19_1","first-page":"235","article-title":"Space-round tradeoffs for MapReduce computations. In Proc. ICS. ACM","author":"Pietracaprina Andrea","year":"2012","unstructured":"Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, and Eli Upfal. 2012. Space-round tradeoffs for MapReduce computations. In Proc. ICS. ACM, Venice, I, 235--244.","journal-title":"Venice"},{"key":"e_1_3_2_2_20_1","first-page":"1","article-title":"Privacy Preserving Clustering with Constraints. In Proc. ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Prague","volume":"96","author":"Melanie Schmidt Clemens R\u00f6","year":"2018","unstructured":"Clemens R\u00f6 sner and Melanie Schmidt. 2018. Privacy Preserving Clustering with Constraints. In Proc. ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Prague, CZ, 96:1--96:14.","journal-title":"CZ"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645568","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:27:46Z","timestamp":1755822466000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":21,"alternative-id":["10.1145\/3589334.3645568","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645568","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}