Research map / Learning theory and algorithms / Clustering
Near-Optimal $k$-Clustering in the Sliding Window Model
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
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.90)
- Universal Weak Coreset (AAAI 2024 · similarity 0.88)
- Coresets for Clustering Under Stochastic Noise (NeurIPS 2025 · similarity 0.88)
- Dynamic k-center clustering with lifetimes (NeurIPS 2026 · similarity 0.88)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 2024 · similarity 0.87)
- Competitively Consistent Clustering (ICML 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.