{"id":"https://openalex.org/W7167842161","doi":"https://doi.org/10.48550/arxiv.2607.07615","title":"Faster Randomized and Deterministic k-Clustering on Graphs","display_name":"Faster Randomized and Deterministic k-Clustering on Graphs","publication_year":2026,"publication_date":"2026-07-08","ids":{"openalex":"https://openalex.org/W7167842161","doi":"https://doi.org/10.48550/arxiv.2607.07615"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.07615","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07615","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.2607.07615","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140315989","display_name":"Sebastian Forster","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Forster, Sebastian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nazari, Yasamin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140333603","display_name":"Rajath Rao K. N.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N., Rajath Rao K.","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.8151999711990356,"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.8151999711990356,"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.045099999755620956,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.019600000232458115,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6783000230789185},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.6608999967575073},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6025999784469604},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4846999943256378},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.46380001306533813},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.44940000772476196},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.33169999718666077}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6783000230789185},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6608999967575073},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6025999784469604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5814999938011169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5004000067710876},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.46380001306533813},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.44940000772476196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44839999079704285},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42800000309944153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35040000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2752000093460083},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.07615","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07615","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.2607.07615","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.07615","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,109,169,181],"paper,":[2],"we":[3,146,171],"study":[4],"the":[5,15,24,32,67,175,190,207,236],"$(k,z)$-clustering":[6,13,88,152],"and":[7,18,58,104,125,133],"$k$-center":[8,37,68],"problems":[9],"on":[10,38,89,153],"graphs,":[11],"where":[12,72],"generalizes":[14],"$k$-median":[16,102,118],"($z=1$)":[17,103],"$k$-means":[19,105],"($z=2$)":[20],"problems.":[21],"We":[22],"obtain":[23,168],"following":[25],"main":[26],"results.":[27],"Our":[28,62,80],"first":[29,33],"contribution":[30,82],"is":[31,83],"deterministic":[34,149],"algorithm":[35,86,114,150],"for":[36,87,117,139,151,162,210],"graphs":[39,90,154],"that":[40,91,155,209,222],"achieves":[41,92,136,156],"a":[42,84,126,148,163,217,231],"$(2+\\varepsilon)$-approximation":[43],"in":[44,95,99,159,196,206],"$\\tilde{O}(m)$":[45,96],"time.":[46],"This":[47],"affirmatively":[48],"resolves":[49],"an":[50,93,111,157],"open":[51],"problem":[52],"raised":[53],"by":[54,119],"Abboud,":[55],"Cohen-Addad,":[56],"Lee,":[57],"Manurangsi":[59],"[SOSA":[60],"2023].":[61],"techniques":[63,173],"also":[64],"extend":[65],"to":[66,74,108,235],"with":[69],"outliers":[70],"problem,":[71],"up":[73],"$t$":[75],"points":[76],"may":[77,184],"be":[78,185],"discarded.":[79],"second":[81],"randomized":[85,113],"$O(1)$-approximation":[94],"time,":[97,161],"which":[98],"particular":[100],"covers":[101],"($z=2$).":[106],"Prior":[107],"work,":[110],"$\\tilde{O}(m)$-time":[112],"was":[115],"known":[116],"Thorup":[120],"[SIAM":[121],"J.":[122],"Comput.":[123],"2005],":[124],"recent":[127],"work":[128],"of":[129,186,193,201,219,225],"Jiang,":[130],"Jin,":[131],"Lou,":[132],"Lu":[134],"[2026]":[135],"$m^{1+o(1)}$":[137],"time":[138],"general":[140],"$z$":[141],"via":[142],"local":[143],"search.":[144],"Finally,":[145],"design":[147],"$O(\\mathrm{poly}(c))$-approximation":[158],"$\\tilde{O}(m^{1+1/c})$":[160],"positive":[164],"parameter":[165,213],"$c$.":[166],"To":[167],"result,":[170],"use":[172],"from":[174],"Thorup-Zwick":[176],"distance":[177,194],"oracle":[178],"[JACM":[179],"2005];":[180],"technical":[182],"connection":[183],"independent":[187],"interest,":[188],"considering":[189],"wide":[191],"application":[192],"oracles":[195],"various":[197],"computational":[198],"settings.":[199],"Most":[200],"our":[202],"algorithms":[203],"are":[204],"incremental,":[205],"sense":[208],"any":[211],"given":[212],"$k$,":[214],"they":[215],"return":[216],"sequence":[218],"centers":[220],"such":[221],"every":[223],"prefix":[224],"length":[226],"$\\ell":[227],"\\leq":[228],"k$":[229],"yields":[230],"constant-factor":[232],"approximate":[233],"solution":[234],"$\\ell$-clustering":[237],"problem.":[238]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-10T00:00:00"}