{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:29Z","timestamp":1779174869576,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2348919, 2107290"],"award-info":[{"award-number":["2348919, 2107290"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709184","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T11:46:41Z","timestamp":1743767201000},"page":"189-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fair Set Cover"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1687-8012","authenticated-orcid":false,"given":"Mohsen","family":"Dehghankar","sequence":"first","affiliation":[{"name":"University of Illinois Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6610-4404","authenticated-orcid":false,"given":"Rahul","family":"Raychaudhury","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2114-8886","authenticated-orcid":false,"given":"Stavros","family":"Sintos","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-6186","authenticated-orcid":false,"given":"Abolfazl","family":"Asudeh","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Propublica compas dataset","author":"Angwin J.","year":"2016","unstructured":"J. Angwin, J. Larson, S. Mattu, and L. Kirchner. Propublica compas dataset, 2016."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-01072-1"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86838-3_4"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3317587"},{"key":"e_1_3_2_2_6_1","first-page":"2017","article-title":"Fairness in machine learning","volume":"1","author":"Barocas S.","year":"2017","unstructured":"S. Barocas, M. Hardt, and A. Narayanan. Fairness in machine learning. Nips tutorial, 1:2017, 2017.","journal-title":"Nips tutorial"},{"key":"e_1_3_2_2_7_1","volume-title":"Fairness and machine learning: Limitations and opportunities","author":"Barocas S.","year":"2023","unstructured":"S. Barocas, M. Hardt, and A. Narayanan. Fairness and machine learning: Limitations and opportunities. MIT Press, 2023."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3593013.3594105"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106287"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338271"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380753"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30053"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"D.-Y. Cho Y.-A. Kim and T. M. Przytycka. Chapter 5: Network biology approach to complex diseases. PLoS computational biology 8(12):e1002820 2012.","DOI":"10.1371\/journal.pcbi.1002820"},{"key":"e_1_3_2_2_14_1","volume-title":"Fair set cover. arXiv preprint arXiv:2405.11639","author":"Dehghankar M.","year":"2024","unstructured":"M. Dehghankar, R. Raychaudhury, S. Sintos, and A. Asudeh. Fair set cover. arXiv preprint arXiv:2405.11639, 2024."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/75247.75248"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44985-X_22"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372847"},{"key":"e_1_3_2_2_18_1","volume-title":"Uci machine learning repository: Adult data set","author":"Dua D.","year":"2019","unstructured":"D. Dua and C. Graff. Uci machine learning repository: Adult data set, 2019. Accessed: 2024-05-20."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25698"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00675-y"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2010.05.043"},{"key":"e_1_3_2_2_22_1","volume-title":"Cluster analysis and mathematical programming. Mathematical programming, 79(1--3):191--215","author":"Hansen P.","year":"1997","unstructured":"P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathematical programming, 79(1--3):191--215, 1997."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10552-006-0102-y"},{"key":"e_1_3_2_2_24_1","first-page":"13270","volume-title":"International Conference on Machine Learning","author":"Hotegni S. S.","year":"2023","unstructured":"S. S. Hotegni, S. Mahabadi, and A. Vakilian. Approximation algorithms for fair range clustering. In International Conference on Machine Learning, pages 13270--13284. PMLR, 2023."},{"key":"e_1_3_2_2_25_1","volume-title":"48th International Symposium on Mathematical Foundations of Computer Science","author":"Inamdar T.","year":"2023","unstructured":"T. Inamdar, L. Kanesh, M. Kundu, N. Purohit, and S. Saurabh. Fixed-parameter algorithms for fair hitting set problems. In 48th International Symposium on Mathematical Foundations of Computer Science, 2023."},{"key":"e_1_3_2_2_26_1","volume-title":"28th Annual European Symposium on Algorithms (ESA 2020)","author":"Inamdar T.","year":"2020","unstructured":"T. Inamdar and K. Varadarajan. Capacitated sum-of-radii clustering: An fpt approximation. In 28th Annual European Symposium on Algorithms (ESA 2020), 2020."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.09.016"},{"key":"e_1_3_2_2_28_1","first-page":"4940","volume-title":"International conference on machine learning","author":"Jones M.","year":"2020","unstructured":"M. Jones, H. Nguyen, and T. Nguyen. Fair k-centers via maximum matching. In International conference on machine learning, pages 4940--4949. PMLR, 2020."},{"key":"e_1_3_2_2_29_1","volume-title":"A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041","author":"Jung C.","year":"2019","unstructured":"C. Jung, S. Kannan, and N. Lutz. A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041, 2019."},{"key":"e_1_3_2_2_30_1","volume-title":"8th Innovations in Theoretical Computer Science Conference (ITCS 2017)","author":"Kleinberg J.","year":"2017","unstructured":"J. Kleinberg, S. Mullainathan, and M. Raghavan. Inherent trade-offs in the fair determination of risk scores. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017."},{"key":"e_1_3_2_2_31_1","first-page":"3448","volume-title":"International Conference on Machine Learning","author":"Kleindessner M.","year":"2019","unstructured":"M. Kleindessner, P. Awasthi, and J. Morgenstern. Fair k-center clustering for data summarization. In International Conference on Machine Learning, pages 3448--3457. PMLR, 2019."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91608-4_51"},{"key":"e_1_3_2_2_33_1","first-page":"3246","volume-title":"Conference on Learning Theory","author":"Makarychev Y.","year":"2021","unstructured":"Y. Makarychev and A. Vakilian. Approximation algorithms for socially fair clustering. In Conference on Learning Theory, pages 3246--3264. PMLR, 2021."},{"key":"e_1_3_2_2_34_1","unstructured":"C. Marcelle. Analysis of influencer marketing and social media diversity reflects visual bias. chantellemarcelle.com\/influencer-marketing-reflects-social-mediadiversity-issue\/."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533171"},{"key":"e_1_3_2_2_36_1","volume-title":"A survey on bias and fairness in machine learning. ACM computing surveys (CSUR), 54(6):1--35","author":"Mehrabi N.","year":"2021","unstructured":"N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan. A survey on bias and fairness in machine learning. ACM computing surveys (CSUR), 54(6):1--35, 2021."},{"key":"e_1_3_2_2_37_1","first-page":"899","volume-title":"Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs)","volume":"2","author":"Monma C.","year":"1989","unstructured":"C. Monma and S. Suri. Partitioning points and graphs to minimize the maximum or the sum of diameters. In Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs), volume 2, pages 899--912, 1989."},{"key":"e_1_3_2_2_38_1","volume-title":"Machine learning and and Decision making (AFair-AMLD23)","author":"Nguyen K. D.","year":"2023","unstructured":"K. D. Nguyen, N. Shahbazi, and A. Asudeh. Popsim: An individual-level population simulator for equitable allocation of city resources. Algorithmic Fairness in Artificial intelligence, Machine learning and and Decision making (AFair-AMLD23), 2023."},{"key":"e_1_3_2_2_39_1","volume-title":"A review on fairness in machine learning. ACM Computing Surveys (CSUR), 55(3):1--44","author":"Pessach D.","year":"2022","unstructured":"D. Pessach and E. Shmueli. A review on fairness in machine learning. ACM Computing Surveys (CSUR), 55(3):1--44, 2022."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1976.tb00529.x"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.1.34"},{"key":"e_1_3_2_2_42_1","volume-title":"CNN","author":"Simon M.","year":"2009","unstructured":"M. Simon. HP looking into claim webcams can't see black people. CNN, 2009."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551824"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86520-7_47"},{"key":"e_1_3_2_2_45_1","volume-title":"Recode","author":"Townsend T.","year":"2017","unstructured":"T. Townsend. Most engineers are white and so are the faces they use to train software. Recode, 2017."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/831"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_9"},{"key":"e_1_3_2_2_48_1","volume-title":"WTTW","author":"Vinicky A.","year":"2022","unstructured":"A. Vinicky. While a black-owned cannabis dispensary opens in chicago, critics say state's equity work still falling short. WTTW, 2022."},{"key":"e_1_3_2_2_49_1","volume-title":"Balancing utility and fairness in submodular maximization (technical report). arXiv preprint arXiv:2211.00980","author":"Wang Y.","year":"2022","unstructured":"Y. Wang, Y. Li, F. Bonchi, and Y. Wang. Balancing utility and fairness in submodular maximization (technical report). arXiv preprint arXiv:2211.00980, 2022."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"e_1_3_2_2_51_1","first-page":"379","volume-title":"Greedy set-cover algorithms (1974-1979, chv\u00e1tal, johnson, lov\u00e1sz, stein). Encyclopedia of algorithms","author":"Young N. E.","year":"2008","unstructured":"N. E. Young. Greedy set-cover algorithms (1974-1979, chv\u00e1tal, johnson, lov\u00e1sz, stein). Encyclopedia of algorithms, pages 379--381, 2008."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132938"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:47:24Z","timestamp":1755359244000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":52,"alternative-id":["10.1145\/3690624.3709184","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709184","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}