AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Distributed Algorithms for Euclidean Clustering

Vincent Cohen-Addad, Liudeng Wang, David Woodruff, Samson Zhou

ICLR 2026 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace Mettu-Plaxton with adaptive sampling for the constant-factor approximationdistributed k-means in the blackboard model · DIGITS (k=10)k-means clustering costImproved
add compact power-of-two encoding of centers after adaptive sampling (EAS vs MP)adaptive sampling · DIGITS (k=10)communication costImproved
add quantization of centers to powers of two (EAS vs AS)adaptive sampling · Synthetic Gaussian mixture (k=5)clustering cost vs communication tradeoffMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy