Research map / Learning theory and algorithms / Clustering
Approximation Preserving Coresets
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
- Universal Weak Coreset (AAAI 2024 · similarity 0.90)
- Coresets for Clustering Under Stochastic Noise (NeurIPS 2025 · similarity 0.88)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.88)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.88)
- Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers (NeurIPS 2025 · similarity 0.86)
- Optimal Coresets for Low-Dimensional Geometric Median (ICML 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.