k-median clustering

A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median AAAI 2026 Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High Dimensions AAAI 2026 Parameterized Approximation Schemes for Fair-Range Clustering NeurIPS 2024 Universal Weak Coreset AAAI 2024 k-Means Clustering with Distance-Based Privacy NeurIPS 2023 A Constant-Factor Approximation Algorithm for Reconciliation k-Median AISTATS 2023 Clustering What Matters: Optimal Approximation for Clustering with Outliers AAAI 2023 k-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy NeurIPS 2023 Near-optimal Coresets for Robust Clustering ICLR 2023 Near-Optimal Quantum Coreset Construction Algorithms for Clustering ICML 2023 Coreset for Line-Sets Clustering NeurIPS 2022 How to Find a Good Explanation for Clustering? AAAI 2022 Near-Optimal Private and Scalable k-Clustering NeurIPS 2022 A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering NeurIPS 2021 Consistent k-Median: Simpler, Better and Robust AISTATS 2021 Coresets for Clustering with Missing Values NeurIPS 2021 Dimensionality Reduction for the Sum-of-Distances Metric ICML 2021 Large Scale K-Median Clustering for Stable Clustering Instances AISTATS 2021 Parallel and Efficient Hierarchical k-Median Clustering NeurIPS 2021 Differentially Private Clustering: Tight Approximation Ratios NeurIPS 2020 Fair Correlation Clustering AISTATS 2020 Layered Sampling for Robust Optimization Problems ICML 2020 Sequential no-Substitution k-Median-Clustering AISTATS 2020 Sliding Window Algorithms for k-Clustering Problems NeurIPS 2020 Coresets for Clustering with Fairness Constraints NeurIPS 2019