Research map / Learning theory and algorithms / Clustering
Extreme k-Center 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use DISTRIBUTED-k-CENTER instead of sequential greedy | k-center clustering · en-wiki | runtime: 7 -> 614 | Helped |
| Use DISTRIBUTED-k-CENTER instead of sequential greedy | k-center clustering · prod | runtime: 63 -> 380 | Helped |
| Use DISTRIBUTED-k-CENTER instead of sequential greedy | k-center clustering · song | solution radius relative to greedy: 1.2 to 2.0 | Mixed |
| Use proximity-based sampling and bagging rather than arbitrary or uniform-random partitioning | distributed k-center core-set construction · k-center clustering | core-set feasibility | Helped |
Closest papers by meaning
- Improved Guarantees for Fully Dynamic $k$-Center Clustering with Outliers in General Metric Spaces (NeurIPS 2024 · similarity 0.91)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.90)
- Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse (ICML 2025 · similarity 0.89)
- Dynamic k-center clustering with lifetimes (NeurIPS 2026 · similarity 0.88)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.87)
- Fully-Scalable Massively Parallel Algorithm for k-center with Outliers (AAAI 2025 · similarity 0.87)
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.