{"id":"https://openalex.org/W7134840571","doi":"https://doi.org/10.48550/arxiv.2603.08615","title":"Distributed Algorithms for Euclidean Clustering","display_name":"Distributed Algorithms for Euclidean Clustering","publication_year":2026,"publication_date":"2026-03-09","ids":{"openalex":"https://openalex.org/W7134840571","doi":"https://doi.org/10.48550/arxiv.2603.08615"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.08615","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128653701","display_name":"Vincent Cohen-Addad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cohen-Addad, Vincent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017486127","display_name":"L. Wang","orcid":"https://orcid.org/0009-0004-7207-4524"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Liudeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128667013","display_name":"David P. Woodruff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Woodruff, David P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128663474","display_name":"Samson Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Samson","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2910343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6687999963760376,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6687999963760376,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09149999916553497,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.05779999867081642,"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/focus","display_name":"Focus (optics)","score":0.5353999733924866},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5267999768257141},{"id":"https://openalex.org/keywords/blackboard","display_name":"Blackboard (design pattern)","score":0.48919999599456787},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.47870001196861267},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4659999907016754},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.46149998903274536},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4239000082015991},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.413100004196167}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6593999862670898},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5353999733924866},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49149999022483826},{"id":"https://openalex.org/C2778308757","wikidata":"https://www.wikidata.org/wiki/Q23601418","display_name":"Blackboard (design pattern)","level":2,"score":0.48919999599456787},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.47870001196861267},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4659999907016754},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.46149998903274536},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.413100004196167},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34389999508857727},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3303000032901764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31619998812675476},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31380000710487366},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.25940001010894775}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.08615","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.08615","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.08615","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:doi:10.48550/arxiv.2603.08615","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"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":{"We":[0,23],"study":[1],"the":[2,11,30,34,38,71,83,89,135,139],"problem":[3],"of":[4,138],"constructing":[5],"$(1+\\varepsilon)$-coresets":[6],"for":[7,117],"Euclidean":[8],"$(k,z)$-clustering":[9],"in":[10],"distributed":[12],"setting,":[13],"where":[14],"$n$":[15],"data":[16],"points":[17],"are":[18],"partitioned":[19],"across":[20,79],"$s$":[21],"sites.":[22],"focus":[24],"on":[25],"two":[26],"prominent":[27],"communication":[28,52,90,136],"models:":[29],"coordinator":[31,39],"model":[32],"and":[33,124,144],"blackboard":[35,84],"model.":[36],"In":[37,82],"model,":[40,85],"we":[41,86],"design":[42],"a":[43,47],"protocol":[44],"that":[45,132],"achieves":[46],"$(1+\\varepsilon)$-strong":[48],"coreset":[49,122,142],"with":[50,120],"total":[51],"complexity":[53,91],"$\\tilde{O}\\left(sk":[54],"+":[55,57,94,96],"\\frac{dk}{\\min(\\varepsilon^4,\\varepsilon^{2+z})}":[56],"dk\\log(n\u0394)\\right)$":[58],"bits,":[59,98],"improving":[60],"upon":[61],"prior":[62],"work":[63],"(Chen":[64,148],"et":[65,149],"al.,":[66,150,155],"NeurIPS":[67,151],"2016)":[68],"by":[69],"eliminating":[70],"need":[72],"to":[73,92,109,129,159],"communicate":[74],"explicit":[75],"point":[76],"coordinates":[77],"in-the-clear":[78],"all":[80],"servers.":[81],"further":[87],"reduce":[88],"$\\tilde{O}\\left(s\\log(n\u0394)":[93],"dk\\log(n\u0394)":[95],"\\frac{dk}{\\min(\\varepsilon^4,\\varepsilon^{2+z})}\\right)$":[97],"achieving":[99],"better":[100],"bounds":[101,147],"than":[102],"previous":[103],"approaches":[104],"while":[105],"upgrading":[106],"from":[107],"constant-factor":[108,118],"$(1+\\varepsilon)$-approximation":[110],"guarantees.":[111],"Our":[112],"techniques":[113],"combine":[114],"new":[115],"strategies":[116],"approximation":[119],"efficient":[121],"constructions":[123,143],"compact":[125],"encoding":[126],"schemes,":[127],"leading":[128],"optimal":[130],"protocols":[131],"match":[133],"both":[134],"costs":[137],"best-known":[140],"offline":[141],"existing":[145],"lower":[146],"2016,":[152],"Huang":[153],"et.":[154],"STOC":[156],"2024),":[157],"up":[158],"polylogarithmic":[160],"factors.":[161]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-03-11T00:00:00"}