{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:45:49Z","timestamp":1783536349516,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819230","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"561-570","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Composable Coresets for Fair Diversity Maximization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5831-1482","authenticated-orcid":false,"given":"Ali","family":"Ahmadvand","sequence":"first","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4690-821X","authenticated-orcid":false,"given":"Mohammad","family":"Ansari","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5171-7065","authenticated-orcid":false,"given":"Mobin","family":"Razavi","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2279-4775","authenticated-orcid":false,"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488390"},{"key":"e_1_3_2_1_2_1","first-page":"2883","volume-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","author":"Abbasi-Zadeh S.","year":"2017","unstructured":"S. Abbasi-Zadeh, M. Ghadiri, V. Mirrokni, and M. Zadimoghaddam. Scalable feature selection via distributed diversity maximization. In Proceedings of the 31st AAAI Conference on Artificial Intelligence, pages 2876\u20132883, 2017."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487636"},{"key":"e_1_3_2_1_4_1","first-page":"21","volume-title":"Proceedings of the 25th International Conference on Database Theory","volume":"220","author":"Addanki R.","year":"2022","unstructured":"R. Addanki, A. McGregor, A. Meliou, and Z. Moumoulidou. Improved approximation and scalability for fair max-min diversification. In Proceedings of the 25th International Conference on Database Theory, volume 220 of LIPIcs, pages 7:1\u20137:21, 2022."},{"key":"e_1_3_2_1_5_1","first-page":"48","volume-title":"Proceedings of the 27th Canadian Conference on Computational Geometry","author":"Aghamolaei S.","year":"2015","unstructured":"S. Aghamolaei, M. Farhadi, and H. Zarrabi-Zadeh. Diversity maximization via composable coresets. In Proceedings of the 27th Canadian Conference on Computational Geometry, pages 38\u201348, 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989405"},{"key":"e_1_3_2_1_7_1","first-page":"1748","volume-title":"Proceedings of the 24th International Joint Conference on Artificial Intelligence","author":"Ashkan A.","year":"2015","unstructured":"A. Ashkan, B. Kveton, S. Berkovsky, and Z. Wen. Optimal greedy diversity for recommendation. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, pages 1742\u20131748, 2015."},{"key":"e_1_3_2_1_8_1","first-page":"343","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML)","author":"Assadi S.","year":"2019","unstructured":"S. Assadi, M. Bateni, and V. Mirrokni. Distributed weighted matching via randomized composable coresets. In Proceedings of the 36th International Conference on Machine Learning (ICML), pages 333\u2013343, 2019."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087581"},{"key":"e_1_3_2_1_10_1","first-page":"2599","volume-title":"Proceedings of the 27th Annual Conference on Neural Information Processing Systems (NeurIPS)","author":"Bateni M.","year":"2014","unstructured":"M. Bateni, A. Bhaskara, S. Lattanzi, and V. Mirrokni. Distributed balanced clustering via mapping coresets. In Proceedings of the 27th Annual Conference on Neural Information Processing Systems (NeurIPS), pages 2591\u20132599, 2014."},{"key":"e_1_3_2_1_11_1","first-page":"9","volume-title":"Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NeurIPS)","author":"Bhaskara A.","year":"2016","unstructured":"A. Bhaskara, M. Ghadiri, V. Mirrokni, and O. Svensson. Linear relaxations for finding diverse elements in metric spaces. In Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NeurIPS), pages 1\u20139, 2016."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3086464"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159719"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055541"},{"key":"e_1_3_2_1_15_1","first-page":"725","volume-title":"Proceedings of the 37th International Conference on Machine Learning (ICML)","author":"Celis E.","year":"2018","unstructured":"E. Celis, V. Keswani, D. Straszak, A. Deshpande, T. Kathuria, and N. Vishnoi. Fair and diverse DPP-based data summarization. In Proceedings of the 37th International Conference on Machine Learning (ICML), pages 716\u2013725, 2018."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1145"},{"key":"e_1_3_2_1_17_1","first-page":"200","volume-title":"Proceedings of the 31st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Dehghankar M.","year":"2024","unstructured":"M. Dehghankar, R. Raychaudhury, S. Sintos, and A. Asudeh. Fair set cover. In Proceedings of the 31st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 189\u2013200, 2024."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860709"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90297-O"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25698"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591077"},{"key":"e_1_3_2_1_24_1","volume-title":"Approximation algorithms for maximum dispersion. Operations research letters, 21(3):133\u2013137","author":"Hassin R.","year":"1997","unstructured":"R. Hassin, S. Rubinstein, and A. Tamir. Approximation algorithms for maximum dispersion. Operations research letters, 21(3):133\u2013137, 1997."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.103"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594560"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24775-3_49"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.02.009"},{"issue":"3","key":"e_1_3_2_1_30_1","first-page":"1","article-title":"Faster algorithms for fair max-min diversification","volume":"2","author":"Kurkure Y.","year":"2024","unstructured":"Y. Kurkure, M. Shamo, J. Wiseman, S. Galhotra, and S. Sintos. Faster algorithms for fair max-min diversification in Rd. Proceedings of the ACM on Management of Data, 2(3):1\u201326, 2024.","journal-title":"Rd. Proceedings of the ACM on Management of Data"},{"key":"e_1_3_2_1_31_1","first-page":"4263","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML)","author":"Mahabadi S.","year":"2019","unstructured":"S. Mahabadi, P. Indyk, S. O. Gharan, and A. Rezaei. Composable core-sets for determinant maximization: A simple near-optimal algorithm. In Proceedings of the 36th International Conference on Machine Learning (ICML), pages 4254\u20134263, 2019."},{"key":"e_1_3_2_1_32_1","first-page":"22","volume-title":"Proceedings of the 26th International Workshop on Approximation Algorithms","author":"Mahabadi S.","year":"2023","unstructured":"S. Mahabadi and S. Narayanan. Improved diversity maximization algorithms for matching and pseudoforest. In Proceedings of the 26th International Workshop on Approximation Algorithms, pages 25:1\u201325:22, 2023."},{"key":"e_1_3_2_1_33_1","first-page":"25","volume-title":"Proceedings of the 37th Annual Conference on Neural Information Processing Systems (NeurIPS)","author":"Mahabadi S.","year":"2024","unstructured":"S. Mahabadi and S. Trajanovski. Core-sets for fair and diverse data summarization. In Proceedings of the 37th Annual Conference on Neural Information Processing Systems (NeurIPS), pages 1\u201325, 2024."},{"key":"e_1_3_2_1_34_1","first-page":"1071","volume-title":"Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NeurIPS)","author":"Malkomes G.","year":"2015","unstructured":"G. Malkomes, M. J. Kusner, W. Chen, K. Q. Weinberger, and B. Moseley. Fast distributed k-center clustering with outliers on massive data. In Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NeurIPS), pages 1063\u20131071, 2015."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114296"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746624"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.30.3.290"},{"key":"e_1_3_2_1_38_1","first-page":"25","volume-title":"Proceedings of the 24th International Conference on Database Theory","author":"Moumoulidou Z.","year":"2021","unstructured":"Z. Moumoulidou, A. McGregor, and A. Meliou. Diverse data selection under fairness constraints. In Proceedings of the 24th International Conference on Database Theory, pages 13:1\u201313:25, 2021."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772770"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028275"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772780"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551824"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0990-4"}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:30:30Z","timestamp":1783531830000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":43,"alternative-id":["10.1145\/3816782.3819230","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819230","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}