Research map / Learning theory and algorithms / Clustering
Average Sensitivity of Euclidean k-Clustering
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Clustering Stable Instances of Euclidean k-means. (NeurIPS 2017 · similarity 0.90)
- Parameterized Approximation Algorithms for K-center Clustering and Variants (AAAI 2022 · similarity 0.88)
- Near-Optimal Private and Scalable $k$-Clustering (NeurIPS 2022 · similarity 0.88)
- Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.88)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.86)
- Parameterized Approximation Schemes for Fair-Range Clustering (NeurIPS 2024 · 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.