Research map / Learning theory and algorithms / Clustering
Distributed Algorithms for Euclidean Clustering
Vincent Cohen-Addad, Liudeng Wang, David Woodruff, Samson Zhou
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 changed | Where | Measured | Effect |
|---|---|---|---|
| replace Mettu-Plaxton with adaptive sampling for the constant-factor approximation | distributed k-means in the blackboard model · DIGITS (k=10) | k-means clustering cost | Improved |
| add compact power-of-two encoding of centers after adaptive sampling (EAS vs MP) | adaptive sampling · DIGITS (k=10) | communication cost | Improved |
| add quantization of centers to powers of two (EAS vs AS) | adaptive sampling · Synthetic Gaussian mixture (k=5) | clustering cost vs communication tradeoff | Mixed |
Closest papers by meaning
- Communication-Optimal Distributed Clustering (NeurIPS 2016 · similarity 0.91)
- Coresets for Clustering Using Noisy Comparisons and Few Distance Queries (NeurIPS 2026 · similarity 0.90)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.89)
- Coresets for Clustering Under Stochastic Noise (NeurIPS 2025 · similarity 0.87)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.86)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.86)
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.
