{"id":"https://openalex.org/W7149022390","doi":"https://doi.org/10.48550/arxiv.2604.01726","title":"Adaptive Fully Dynamic $k$-Center Clustering with (Near-)Optimal Worst-Case Guarantees","display_name":"Adaptive Fully Dynamic $k$-Center Clustering with (Near-)Optimal Worst-Case Guarantees","publication_year":2026,"publication_date":"2026-04-02","ids":{"openalex":"https://openalex.org/W7149022390","doi":"https://doi.org/10.48550/arxiv.2604.01726"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01726","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01726","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,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.01726","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132842633","display_name":"Mara Grilnberger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grilnberger, Mara","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073557610","display_name":"Antonis Skarlatos","orcid":"https://orcid.org/0000-0002-7623-9419"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Skarlatos, Antonis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.5864999890327454,"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.5864999890327454,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.15530000627040863,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.05290000140666962,"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/cluster-analysis","display_name":"Cluster analysis","score":0.7166000008583069},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6096000075340271},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.5097000002861023},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46639999747276306},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42829999327659607},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41749998927116394},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4097999930381775},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4065000116825104}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7166000008583069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6219000220298767},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6096000075340271},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.5097000002861023},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46639999747276306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44179999828338623},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42829999327659607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42809998989105225},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3425999879837036},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.33500000834465027},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.32249999046325684},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2563999891281128}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01726","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01726","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,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.01726","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01726","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,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,24,179,201,214,247,251],"sequence":[2],"of":[3,99],"adversarial":[4],"point":[5,8],"insertions":[6],"and":[7,21,56,60,64,80,103,112,157,186,211,236,242],"deletions,":[9],"is":[10,97,196],"it":[11],"possible":[12],"to":[13,120],"simultaneously":[14],"optimize":[15],"the":[16,76,83,92,100,121,125,135,159,166,172,225,233],"approximation":[17,205,229],"ratio,":[18],"update":[19,184,222,238],"time,":[20,185],"recourse":[22,235],"for":[23,75,124],"$k$-clustering":[25,105],"problem?":[26],"If":[27],"so,":[28],"can":[29],"this":[30,73,88,151],"be":[31],"achieved":[32,197],"with":[33,207,220],"worst-case":[34,183,188,209,234,237],"guarantees":[35,145,240],"against":[36,146,191],"an":[37,117,147,192],"adaptive":[38,193],"adversary?":[39],"These":[40],"questions":[41,164],"have":[42,68],"garnered":[43],"significant":[44,70,155],"attention":[45],"in":[46,165],"recent":[47],"years.":[48],"Prior":[49],"works":[50],"by":[51,61,161,198],"Bhattacharya,":[52,62,108],"Costa,":[53,63,109],"Garg,":[54],"Lattanzi,":[55,111],"Parotsidis":[57,113],"[FOCS":[58],"'24]":[59],"Farokhnejad":[65],"[STOC":[66],"'25]":[67,115],"taken":[69],"steps":[71],"toward":[72],"direction":[74],"$k$-median":[77],"clustering":[78,94,127,176],"problem":[79,177],"its":[81],"generalization,":[82],"$(k,":[84],"z)$-clustering":[85],"problem.":[86,128],"In":[87,150],"paper,":[89],"we":[90,153,169,231],"study":[91],"$k$-center":[93,126,175,218],"problem,":[95],"which":[96],"one":[98],"most":[101],"classical":[102],"well-studied":[104],"problems.":[106],"Recently,":[107],"Farokhnejad,":[110],"[ICML":[114],"provided":[116],"affirmative":[118],"answer":[119],"first":[122,199],"question":[123],"However,":[129],"their":[130,139],"work":[131],"did":[132],"not":[133],"resolve":[134],"second":[136],"question,":[137],"as":[138],"result":[140],"provides":[141],"only":[142],"expected":[143],"amortized":[144],"oblivious":[148],"adversary.":[149,194],"work,":[152],"make":[154],"progress":[156],"close":[158],"gap":[160],"answering":[162],"both":[163],"affirmative.":[167],"Specifically,":[168],"show":[170],"that":[171],"fully":[173,202,216,226],"dynamic":[174,203,217,227],"admits":[178],"constant-factor":[180],"approximation,":[181],"near-optimal":[182],"constant":[187],"recourse,":[189],"even":[190],"This":[195],"developing":[200],"bicriteria":[204,228],"algorithm":[206,219,249],"(near-)optimal":[208],"bounds,":[210],"then":[212,243],"designing":[213],"suitable":[215],"near-linear":[221],"time.":[223],"For":[224],"algorithm,":[230],"establish":[232],"time":[239],"separately,":[241],"merge":[244],"them":[245],"into":[246],"single":[248],"through":[250],"simple":[252],"yet":[253],"elegant":[254],"process.":[255]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-04T00:00:00"}