{"id":"https://openalex.org/W4394654141","doi":"https://doi.org/10.1145/3654940","title":"Faster Algorithms for Fair Max-Min Diversification in R <sup>d</sup>","display_name":"Faster Algorithms for Fair Max-Min Diversification in R <sup>d</sup>","publication_year":2024,"publication_date":"2024-05-29","ids":{"openalex":"https://openalex.org/W4394654141","doi":"https://doi.org/10.1145/3654940"},"language":"en","primary_location":{"id":"doi:10.1145/3654940","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3654940","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2404.04713","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098938220","display_name":"Yash Kurkure","orcid":"https://orcid.org/0009-0006-8809-2238"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yash Kurkure","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA"],"raw_orcid":"https://orcid.org/0009-0006-8809-2238","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098938221","display_name":"Miles Shamo","orcid":"https://orcid.org/0009-0007-4248-3775"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Miles Shamo","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA"],"raw_orcid":"https://orcid.org/0009-0007-4248-3775","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039182625","display_name":"Joseph Wiseman","orcid":"https://orcid.org/0009-0003-6534-6395"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Wiseman","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA"],"raw_orcid":"https://orcid.org/0009-0003-6534-6395","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038532934","display_name":"Sainyam Galhotra","orcid":"https://orcid.org/0000-0003-2529-4036"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sainyam Galhotra","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, New York, USA"],"raw_orcid":"https://orcid.org/0000-0003-2529-4036","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, New York, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015883931","display_name":"Stavros Sintos","orcid":"https://orcid.org/0000-0002-2114-8886"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stavros Sintos","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA"],"raw_orcid":"https://orcid.org/0000-0002-2114-8886","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6893,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83883291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"2","issue":"3","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9764000177383423,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6659532785415649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5720250606536865},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5311388373374939},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5042732954025269},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4779098927974701},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4359346032142639},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38697904348373413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3835490942001343}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6659532785415649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5720250606536865},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5311388373374939},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5042732954025269},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4779098927974701},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4359346032142639},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38697904348373413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3835490942001343},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3654940","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3654940","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2404.04713","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2404.04713","pdf_url":"https://arxiv.org/pdf/2404.04713","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2404.04713","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2404.04713","pdf_url":"https://arxiv.org/pdf/2404.04713","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4394654141.pdf","grobid_xml":"https://content.openalex.org/works/W4394654141.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W1965734368","https://openalex.org/W1973264045","https://openalex.org/W1991657767","https://openalex.org/W1994772769","https://openalex.org/W2008196645","https://openalex.org/W2038428842","https://openalex.org/W2042662336","https://openalex.org/W2058384352","https://openalex.org/W2068015060","https://openalex.org/W2080068757","https://openalex.org/W2111336742","https://openalex.org/W2133296809","https://openalex.org/W2133311553","https://openalex.org/W2150865801","https://openalex.org/W2153319198","https://openalex.org/W2317378286","https://openalex.org/W2427881153","https://openalex.org/W2508337090","https://openalex.org/W2522382150","https://openalex.org/W2787705708","https://openalex.org/W2913504990","https://openalex.org/W2949781245","https://openalex.org/W3004466950","https://openalex.org/W3004829830","https://openalex.org/W3029962482","https://openalex.org/W3093481237","https://openalex.org/W3121375331","https://openalex.org/W3131200319","https://openalex.org/W3137423196","https://openalex.org/W3169940233","https://openalex.org/W3208507755","https://openalex.org/W4220859593","https://openalex.org/W4221151470","https://openalex.org/W4285451384","https://openalex.org/W4365398082","https://openalex.org/W4376864828","https://openalex.org/W4384557824","https://openalex.org/W6638525300","https://openalex.org/W6738393657","https://openalex.org/W6749124357","https://openalex.org/W6773745131","https://openalex.org/W6779166545","https://openalex.org/W6888840370","https://openalex.org/W6926337895","https://openalex.org/W6945448703"],"related_works":["https://openalex.org/W4318195686","https://openalex.org/W2975999359","https://openalex.org/W3119693376","https://openalex.org/W2962917430","https://openalex.org/W2107423006","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0,63],"task":[1],"of":[2,36,46,51,58,128,152,182],"extracting":[3],"a":[4,8,17,48,55,125,144,157,199,212],"diverse":[5,49],"subset":[6,39],"from":[7,54],"dataset,":[9],"often":[10],"referred":[11],"to":[12,110,139],"as":[13],"maximum":[14],"diversification,":[15],"plays":[16],"pivotal":[18],"role":[19],"in":[20,68,89,105],"various":[21],"real-world":[22],"applications":[23],"that":[24,87,191],"have":[25],"far-reaching":[26],"consequences.":[27],"In":[28,75,96],"this":[29,76,121],"work,":[30,77],"we":[31,78,148,162],"delve":[32],"into":[33],"the":[34,44,69,80,129,150,165,171,180,195],"realm":[35],"fairness-aware":[37],"data":[38,60,70,137,183],"selection,":[40],"specifically":[41],"focusing":[42],"on":[43,179,187],"problem":[45,65,173],"selecting":[47],"set":[50],"size":[52],"k":[53],"large":[56],"collection":[57],"n":[59,111],"points":[61],"(FairDiv).":[62],"FairDiv":[64,86,172],"is":[66],"well-studied":[67],"management":[71],"and":[72,114,134,141],"theory":[73],"community.":[74],"develop":[79],"first":[81,166],"constant":[82,101],"approximation":[83,102],"algorithm":[84,169,193],"for":[85,170],"runs":[88],"near-linear":[90],"time":[91,107],"using":[92],"only":[93],"linear":[94,145],"space.":[95,117],"contrast,":[97],"all":[98],"previously":[99],"known":[100],"algorithms":[103],"run":[104],"super-linear":[106,116],"(with":[108],"respect":[109],"or":[112,208],"k)":[113],"use":[115],"Our":[118],"approach":[119],"achieves":[120,194],"efficiency":[122,151,175],"by":[123,155],"employing":[124],"novel":[126],"combination":[127],"Multiplicative":[130],"Weight":[131],"Update":[132],"method":[133],"advanced":[135],"geometric":[136],"structures":[138],"implicitly":[140],"approximately":[142],"solve":[143],"program.":[146],"Furthermore,":[147],"improve":[149],"our":[153,160,192],"techniques":[154,203],"constructing":[156],"coreset.":[158],"Using":[159],"coreset,":[161],"also":[163],"propose":[164],"efficient":[167],"streaming":[168],"whose":[174],"does":[176],"not":[177,210],"depend":[178],"distribution":[181],"points.":[184],"Empirical":[185],"evaluation":[186],"million-sized":[188],"datasets":[189],"demonstrates":[190],"best":[196],"diversity":[197],"within":[198],"minute.":[200],"All":[201],"prior":[202],"are":[204],"either":[205],"highly":[206],"inefficient":[207],"do":[209],"generate":[211],"good":[213],"solution.":[214]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2024-04-11T00:00:00"}