{"id":"https://openalex.org/W7163901620","doi":"https://doi.org/10.4230/lipics.swat.2026.19","title":"Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means","display_name":"Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163901620","doi":"https://doi.org/10.4230/lipics.swat.2026.19"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26055","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.19/LIPIcs.SWAT.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.19/LIPIcs.SWAT.2026.19.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134083078","display_name":"Nicole Funk","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Funk, Nicole","raw_affiliation_strings":["Department of Computer Science, University of Cologne, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7826-9291","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092276233","display_name":"Annika Hennes","orcid":"https://orcid.org/0000-0001-9109-3107"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hennes, Annika","raw_affiliation_strings":["Faculty of Mathematics and Natural Sciences, Heinrich Heine University D\u00fcsseldorf, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9109-3107","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Natural Sciences, Heinrich Heine University D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051137945","display_name":"Johanna Hillebrand","orcid":null},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hillebrand, Johanna","raw_affiliation_strings":["Faculty of Mathematics and Natural Sciences, Heinrich Heine University D\u00fcsseldorf, Germany"],"raw_orcid":"https://orcid.org/0009-0005-8009-9681","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Natural Sciences, Heinrich Heine University D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120230544","display_name":"Sarah Sturm","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sturm, Sarah","raw_affiliation_strings":["Department of Computer Science, University of Bonn, Germany"],"raw_orcid":"https://orcid.org/0009-0003-1962-8666","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95448332,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.4099000096321106,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.4099000096321106,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.11840000003576279,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10883","display_name":"Ethics and Social Impacts of AI","score":0.06970000267028809,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6148999929428101},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5393000245094299},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5005000233650208},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4756999909877777},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4717999994754791},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45080000162124634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4496999979019165},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.4458000063896179},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4408999979496002}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7060999870300293},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6148999929428101},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5393000245094299},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4756999909877777},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4717999994754791},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45080000162124634},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4496999979019165},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.4458000063896179},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4408999979496002},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4025999903678894},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.40139999985694885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39730000495910645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39079999923706055},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.37380000948905945},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3553999960422516},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C93361540","wikidata":"https://www.wikidata.org/wiki/Q848569","display_name":"Complete metric space","level":3,"score":0.3052999973297119},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.262800008058548},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26055","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.19/LIPIcs.SWAT.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.19","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26055","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.19/LIPIcs.SWAT.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.604333221912384,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163901620.pdf","grobid_xml":"https://content.openalex.org/works/W7163901620.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,84,115],"study":[1],"discrete":[2],"k-clustering":[3,270],"problems":[4],"in":[5,33],"general":[6],"metric":[7,27],"spaces":[8],"that":[9,60,243],"are":[10,70,261],"constrained":[11,155,251],"by":[12,93,123,217],"a":[13,26,38,42,55,61,118,181,200,241,249],"combination":[14,148],"of":[15,91,121,128,149,172],"two":[16,78,151],"different":[17],"fairness":[18,23,79,188],"conditions":[19],"within":[20],"the":[21,45,68,76,100,125,147,165,186,209,233],"demographic":[22],"model.":[24],"Given":[25],"space":[28],"(P,d),":[29],"where":[30],"every":[31],"point":[32],"P":[34,50],"is":[35,47,65],"equipped":[36],"with":[37,54,73,88,180,199],"protected":[39],"attribute,":[40],"and":[41,67,96,138,220,229,271],"number":[43,127],"k,":[44],"goal":[46],"to":[48,75,130,197,263],"partition":[49],"into":[51,248],"k":[52],"clusters":[53,87],"designated":[56],"center":[57,106,246],"each,":[58],"such":[59,267],"center-based":[62],"objective":[63],"function":[64],"minimized":[66],"attributes":[69,92],"fairly":[71],"distributed":[72],"respect":[74],"following":[77],"concepts:":[80],"1)":[81],"group":[82,187],"fairness:":[83],"aim":[85],"for":[86,99,117,170,213],"balanced":[89,119],"numbers":[90],"specifying":[94,124],"lower":[95],"upper":[97],"bounds":[98],"desired":[101,126],"attribute":[102],"proportions.":[103],"2)":[104],"diverse":[105,245],"selection:":[107],"Clusters":[108],"have":[109],"natural":[110],"representatives,":[111],"i.e.,":[112],"their":[113],"centers.":[114],"ask":[116],"set":[120],"representatives":[122],"centers":[129],"choose":[131],"from":[132],"each":[133],"attribute.":[134],"Dickerson,":[135],"Esmaeili,":[136],"Morgenstern,":[137],"Pena":[139],"[John":[140],"P.":[141],"Dickerson":[142],"et":[143,224],"al.,":[144,225],"2023]":[145],"denote":[146],"these":[150,173],"constraints":[152],"as":[153,268],"doubly":[154,250],"fair":[156,252],"clustering.":[157],"They":[158],"present":[159],"algorithms":[160,239],"whose":[161],"guarantees":[162],"depend":[163],"on":[164,185,208],"best":[166,211],"known":[167],"approximation":[168,195,236],"factors":[169],"either":[171],"problems.":[174],"Currently,":[175],"this":[176,194],"implies":[177],"an":[178,255],"8-approximation":[179],"small":[182,201],"additive":[183,202],"violation":[184],"constraint.":[189],"For":[190,227],"k-center,":[191],"we":[192,231],"improve":[193],"factor":[196],"4":[198],"violation.":[203],"This":[204],"guarantee":[205],"also":[206],"depends":[207],"currently":[210],"algorithm":[212],"DS-fair":[214],"k-center":[215],"given":[216],"Jones,":[218],"Nguyen":[219,221],"[Matthew":[222],"Jones":[223],"2020].":[226],"k-median":[228],"k-means,":[230],"propose":[232],"first":[234],"constant-factor":[235],"algorithms.":[237],"Our":[238],"transform":[240],"solution":[242],"satisfies":[244],"selection":[247],"clustering":[253],"using":[254],"LP-based":[256],"approach.":[257],"Furthermore,":[258],"our":[259],"results":[260],"generalizable":[262],"other":[264],"center-selection":[265],"constraints,":[266],"matroid":[269],"knapsack":[272],"constraints.":[273]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}