Research map / Learning theory and algorithms / Clustering
Faster Query Times for Fully Dynamic $k$-Center Clustering with Outliers
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
- Improved Guarantees for Fully Dynamic $k$-Center Clustering with Outliers in General Metric Spaces (NeurIPS 2024 · similarity 0.95)
- Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse (ICML 2025 · similarity 0.92)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.89)
- Near-Linear Time Approximation Algorithms for k-means with Outliers (ICML 2024 · similarity 0.89)
- Fully-Scalable Massively Parallel Algorithm for k-center with Outliers (AAAI 2025 · similarity 0.89)
- Dynamic k-center clustering with lifetimes (NeurIPS 2026 · similarity 0.88)
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.