{"id":"https://openalex.org/W3185641196","doi":"https://doi.org/10.1007/s10107-021-01674-7","title":"Fair colorful k-center clustering","display_name":"Fair colorful k-center clustering","publication_year":2021,"publication_date":"2021-07-01","ids":{"openalex":"https://openalex.org/W3185641196","doi":"https://doi.org/10.1007/s10107-021-01674-7","mag":"3185641196","pmid":"https://pubmed.ncbi.nlm.nih.gov/35300155","pmcid":"https://www.ncbi.nlm.nih.gov/pmc/articles/8907124"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-021-01674-7","doi":"https://doi.org/10.1007/s10107-021-01674-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01674-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01674-7.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01674-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016839838","display_name":"Xinrui Jia","orcid":"https://orcid.org/0000-0002-5470-536X","observed_orcids":["https://orcid.org/0000-0002-5470-536X"]},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Xinrui Jia","raw_affiliation_strings":["EPFL, Route Cantonale, 1015, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Route Cantonale, 1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112858015","display_name":"Kshiteej Sheth","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Kshiteej Sheth","raw_affiliation_strings":["EPFL, Route Cantonale, 1015, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Route Cantonale, 1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372","observed_orcids":["https://orcid.org/0000-0003-2997-1372"]},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Route Cantonale, 1015, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Route Cantonale, 1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112858015"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":{"value":2740,"currency":"USD","value_usd":2740},"apc_paid":{"value":2740,"currency":"USD","value_usd":2740},"fwci":2.7694,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.90993767,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"192","issue":"1-2","first_page":"339","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9487000107765198,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9487000107765198,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.031599998474121094,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/fair-clustering","display_name":"fair clustering","score":0.7059999704360962},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6330000162124634},{"id":"https://openalex.org/keywords/integrality-gap","display_name":"integrality gap","score":0.8059999942779541},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.9070000052452087},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"subset sum problem","score":0.9039999842643738},{"id":"https://openalex.org/keywords/metric-spaces","display_name":"metric spaces","score":0.5659999847412109},{"id":"https://openalex.org/keywords/coverage-requirements","display_name":"coverage requirements","score":0.6019999980926514},{"id":"https://openalex.org/keywords/k-center-problem","display_name":"k-center problem","score":0.5109999775886536}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7099161148071289},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.6489455103874207},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6328114867210388},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5864219665527344},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5745530724525452},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.566786527633667},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5468295812606812},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5395573377609253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5035642981529236},{"id":"https://openalex.org/C207968372","wikidata":"https://www.wikidata.org/wiki/Q310401","display_name":"k-means clustering","level":3,"score":0.4804793894290924},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.47034481167793274},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4645775258541107},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4614907503128052},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.45372748374938965},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.44772273302078247},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.4181510806083679},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.410108745098114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3932218849658966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30287331342697144},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.279194712638855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22360527515411377},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-021-01674-7","doi":"https://doi.org/10.1007/s10107-021-01674-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01674-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01674-7.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmid:35300155","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/35300155","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical programming","raw_type":"Journal Article"},{"id":"pmh:oai:pubmedcentral.nih.gov:8907124","doi":null,"is_oa":true,"landing_page_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC8907124/","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Math Program","raw_type":"Text"},{"id":"pmh:oai:infoscience.epfl.ch:287277","doi":null,"is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/179946","pdf_url":"https://infoscience.epfl.ch/record/287277/files/s10107-021-01674-7.pdf","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"}],"best_oa_location":{"id":"doi:10.1007/s10107-021-01674-7","doi":"https://doi.org/10.1007/s10107-021-01674-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01674-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01674-7.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G4915951725","display_name":"Randomness in Problem Instances and Randomized Algorithms","funder_award_id":"184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3185641196.pdf","grobid_xml":"https://content.openalex.org/works/W3185641196.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W232814632","https://openalex.org/W1570128105","https://openalex.org/W1607580485","https://openalex.org/W1947552815","https://openalex.org/W1967344706","https://openalex.org/W1973264045","https://openalex.org/W1983197449","https://openalex.org/W2012805418","https://openalex.org/W2073583237","https://openalex.org/W2148012376","https://openalex.org/W2749884410","https://openalex.org/W2947175317","https://openalex.org/W3017065416","https://openalex.org/W3041896098"],"related_works":["https://openalex.org/W3017065416","https://openalex.org/W6966568442","https://openalex.org/W6910918032","https://openalex.org/W2963652799","https://openalex.org/W4411187106","https://openalex.org/W7130604222","https://openalex.org/W4386175283","https://openalex.org/W4391992488","https://openalex.org/W7212035569","https://openalex.org/W4393143006"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"instance":[2],"of":[3,9,49,56,96,140,148],"colorful":[4],"k":[5,25,55,153,165],"-":[6],"center":[7],"consists":[8],"points":[10,58,177],"in":[11,111,170,179],"a":[12,27,79],"metric":[13],"space":[14],"that":[15,45,59,107,131],"are":[16,178],"colored":[17],"red":[18],"or":[19,167],"blue,":[20],"along":[21,98],"with":[22,99],"an":[23,127,137],"integer":[24],"and":[26,83],"coverage":[28,62],"requirement":[29],"for":[30,117,150],"each":[31,75],"color.":[32],"The":[33,64],"goal":[34],"is":[35,69,126],"to":[36,135],"find":[37],"the":[38,57,61,86,94,100,144,151,171,175,180],"smallest":[39],"radius":[40,50],"$$\\rho":[41,51],"$$":[42,52],"\u03c1":[43,53],"such":[44],"there":[46],"exist":[47],"balls":[48],"around":[54],"meet":[60],"requirements.":[63],"motivation":[65],"behind":[66],"this":[67,91,108,157],"problem":[68,92,155,158],"twofold.":[70],"First,":[71],"from":[72,85],"fairness":[73],"considerations:":[74],"color/group":[76],"should":[77],"receive":[78],"similar":[80],"service":[81],"guarantee,":[82],"second,":[84],"algorithmic":[87],"challenges":[88],"it":[89],"poses:":[90],"combines":[93],"difficulties":[95,134],"clustering":[97],"subset-sum":[101],"problem.":[102],"In":[103],"particular,":[104],"we":[105],"show":[106],"combination":[109],"results":[110],"strong":[112],"integrality":[113],"gap":[114],"lower":[115],"bounds":[116],"several":[118],"natural":[119],"linear":[120],"programming":[121],"relaxations.":[122],"Our":[123],"main":[124],"result":[125],"efficient":[128],"approximation":[129,138,146],"algorithm":[130],"overcomes":[132],"these":[133],"achieve":[136],"guarantee":[139,147],"3,":[141],"nearly":[142],"matching":[143],"tight":[145],"2":[149],"classical":[152],"-center":[154],"which":[156],"generalizes.":[159],"algorithms":[160],"either":[161],"opened":[162],"more":[163],"than":[164],"centers":[166],"only":[168],"worked":[169],"special":[172],"case":[173],"when":[174],"input":[176],"plane.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2021-08-02T00:00:00"}
