{"id":"https://openalex.org/W7224831298","doi":"https://doi.org/10.48550/arxiv.2610.40625","title":"Constant-Factor Approximation for Capacitated Clustering in Low Dimension with $(1+\u03b5)k$ Centers","display_name":"Constant-Factor Approximation for Capacitated Clustering in Low Dimension with $(1+\u03b5)k$ Centers","publication_year":2026,"publication_date":"2026-10-29","ids":{"openalex":"https://openalex.org/W7224831298","doi":"https://doi.org/10.48550/arxiv.2610.40625"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.40625","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40625","pdf_url":"https://arxiv.org/pdf/2610.40625","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.40625","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128874477","display_name":"Kangke Cheng","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cheng, Kangke","raw_affiliation_strings":["University of Science and Technology of China , Hefei , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Science and Technology of China , Hefei , China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098938331","display_name":"Guanlin Mo","orcid":"https://orcid.org/0009-0001-4735-3212","observed_orcids":["https://orcid.org/0009-0001-4735-3212"]},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mo, Guanlin","raw_affiliation_strings":["University of Science and Technology of China , Hefei , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Science and Technology of China , Hefei , China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5160171539","display_name":"Hu Ding","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ding, Hu","raw_affiliation_strings":["University of Science and Technology of China , Hefei , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Science and Technology of China , Hefei , China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5795999765396118,"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.5795999765396118,"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.2865999937057495,"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.041600000113248825,"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/k-median","display_name":"k-median","score":0.8690000176429749},{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"K-means clustering","score":0.9990000128746033},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5839999914169312},{"id":"https://openalex.org/keywords/capacity-constraints","display_name":"capacity constraints","score":0.5910000205039978},{"id":"https://openalex.org/keywords/doubling-dimension","display_name":"doubling dimension","score":0.5120000243186951},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.824999988079071},{"id":"https://openalex.org/keywords/constant-factor-approximation","display_name":"constant-factor approximation","score":0.4740000069141388},{"id":"https://openalex.org/keywords/metric-spaces","display_name":"metric spaces","score":0.3580000102519989},{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.5040000081062317}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7044000029563904},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.6152999997138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5325000286102295},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.526199996471405},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.49320000410079956},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43939998745918274},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4284000098705292},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.40369999408721924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4025000035762787},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.40220001339912415},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3418999910354614},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30979999899864197},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2879999876022339},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.2759000062942505},{"id":"https://openalex.org/C153740404","wikidata":"https://www.wikidata.org/wiki/Q671224","display_name":"Data center","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.40625","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40625","pdf_url":"https://arxiv.org/pdf/2610.40625","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.40625","doi":"https://doi.org/10.48550/arxiv.2610.40625","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.40625","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.40625","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.40625","pdf_url":"https://arxiv.org/pdf/2610.40625","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7224831298.pdf","grobid_xml":"https://content.openalex.org/works/W7224831298.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3008182893","https://openalex.org/W2952088675","https://openalex.org/W2577436344","https://openalex.org/W2904830225","https://openalex.org/W1999939497","https://openalex.org/W2965779392","https://openalex.org/W32284950","https://openalex.org/W3082525881","https://openalex.org/W4415653896","https://openalex.org/W4415329424"],"abstract_inverted_index":{"In":[0],"many":[1],"applications":[2],"of":[3,20,47,71,146,228,261],"$k$-median":[4,120,131],"and":[5,10,55,121,168,174],"$k$-means,":[6,124],"including":[7],"load":[8],"balancing":[9],"redistricting,":[11],"each":[12,244],"center":[13,38,106,227,239,246],"can":[14,194,240],"serve":[15],"only":[16],"a":[17,29,36,78,88,143,186,190,226,235],"bounded":[18,109,141,163],"number":[19],"clients.":[21],"This":[22,45,252],"leads":[23],"to":[24,34,225],"capacitated":[25,66],"clustering,":[26],"in":[27,61,96,127,132,171,177,179,270],"which":[28],"client":[30],"may":[31],"be":[32,195,241],"forced":[33],"use":[35],"distant":[37],"because":[39],"all":[40],"nearby":[41],"ones":[42],"are":[43,136],"full.":[44],"loss":[46],"locality":[48],"defeats":[49],"the":[50,83,102,105,133,137,149,214,229,262,265],"techniques":[51],"behind":[52],"approximation":[53,58],"schemes,":[54],"no":[56],"constant-factor":[57],"is":[59,117,232],"known":[60],"general":[62,180],"metrics":[63],"even":[64,154],"for":[65,77,92,119,123,155,166],"$k$-median.":[67,156],"A":[68],"long":[69],"line":[70],"work":[72],"therefore":[73],"opens":[74],"$K=k+\\lfloor\u03b5k\\rfloor$":[75],"centers":[76,205,256],"fixed":[79],"$\u03b5\\in(0,1]$,":[80],"while":[81],"respecting":[82],"capacities":[84,95,170],"exactly.":[85],"We":[86,157],"give":[87],"deterministic":[89],"polynomial-time":[90,139],"algorithm":[91],"uniform":[93],"soft":[94],"low":[97,172],"dimension,":[98,173],"that":[99,161,218,222,238],"is,":[100],"when":[101],"clients":[103,224],"or":[104,125],"locations":[107],"have":[108],"doubling":[110],"dimension.":[111],"With":[112],"$K$":[113],"centers,":[114],"its":[115],"ratio":[116,151],"$3-2\u03b5$":[118],"$9-8\u03b5$":[122],"$5-4\u03b5$":[126],"$\\mathbb{R}^d$.":[128],"Apart":[129],"from":[130,185],"plane,":[134],"these":[135],"first":[138],"ratios":[140,160,175],"by":[142],"constant":[144],"independent":[145],"$\u03b5$;":[147],"previously,":[148],"best":[150],"was":[152],"$O(\u03b5^{-2}\\log(1/\u03b5))$,":[153],"also":[158],"obtain":[159],"stay":[162],"as":[164],"$\u03b5\\to0$":[165],"non-uniform":[167],"hard":[169],"polylogarithmic":[176],"$1/\u03b5$":[178],"metrics.":[181],"Our":[182,211],"approach":[183],"starts":[184],"simple":[187],"structural":[188],"observation:":[189],"near-optimal":[191],"uncapacitated":[192],"solution":[193,231],"split":[196],"into":[197],"fewer":[198],"than":[199],"$2k$":[200,204],"capacity-respecting":[201],"blocks,":[202,263],"so":[203,243],"already":[206],"suffice,":[207],"one":[208],"per":[209],"block.":[210],"main":[212],"tool,":[213],"rescue":[215,257],"lemma,":[216],"shows":[217],"once":[219],"every":[220],"block":[221],"sends":[223],"optimal":[230],"rescued":[233],"(given":[234],"private":[236],"center),":[237],"closed,":[242],"extra":[245,255],"effectively":[247],"rescues":[248],"about":[249],"two":[250],"blocks.":[251],"lets":[253],"$\\lfloor\u03b5k\\rfloor$":[254],"nearly":[258],"an":[259],"$\u03b5$-fraction":[260],"yielding":[264],"linear":[266],"dependence":[267],"on":[268],"$\u03b5$":[269],"our":[271],"ratios.":[272]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-10-31T00:00:00"}