Research map / Learning theory and algorithms / Clustering
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering
Tom Hess, Michal Moshkovitz, Sivan Sabato
Read the paperCheck your idea against 137,217 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
- Consistent k-Clustering (ICML 2017 · similarity 0.88)
- Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.88)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.87)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.87)
- Dynamic Algorithm for Explainable $k$-medians Clustering under $\ell_p$ Norm (NeurIPS 2025 · similarity 0.86)
- Clustering with Non-adaptive Subset Queries (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.
