{"total":21,"rows":[{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26,"area":null},{"id":"2202.12793","title":"Towards Optimal Lower Bounds for k-median and k-means Coresets","created":"2022-02-25","cited_by_count":23,"area":null},{"id":"2112.14445","title":"Differentially-Private Clustering of Easy Instances","created":"2021-12-29","cited_by_count":17,"area":null},{"id":"2203.04370","title":"New Coresets for Projective Clustering and Applications","created":"2022-03-08","cited_by_count":16,"area":null},{"id":"2111.03193","title":"Explainable k-means. Don't be greedy, plant bigger trees!","created":"2021-11-04","cited_by_count":15,"area":null},{"id":"2204.04828","title":"Improved Approximations for Euclidean $k$-means and $k$-median, via Nested Quasi-Independent Sets","created":"2022-04-11","cited_by_count":14,"area":null},{"id":"2107.00798","title":"Near-optimal Algorithms for Explainable k-Medians and k-Means","created":"2021-07-02","cited_by_count":13,"area":null},{"id":"2110.08991","title":"Dimensionality Reduction for Wasserstein Barycenter","created":"2021-10-18","cited_by_count":13,"area":null},{"id":"2111.10912","title":"Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics","created":"2021-11-21","cited_by_count":8,"area":null},{"id":"2207.07949","title":"A Nearly Tight Analysis of Greedy k-means++","created":"2022-07-16","cited_by_count":7,"area":null},{"id":"2309.16384","title":"Multi-Swap $k$-Means++","created":"2023-09-28","cited_by_count":5,"area":null},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","cited_by_count":4,"area":null},{"id":"2306.01869","title":"Fast $(1+\\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization","created":"2023-06-02","cited_by_count":3,"area":null},{"id":"2106.07319","title":"Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space","created":"2021-06-14","cited_by_count":2,"area":null},{"id":"2205.10403","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","created":"2022-05-20","cited_by_count":2,"area":null},{"id":"2106.12959","title":"Differentially Private Algorithms for Clustering with Stability Assumptions","created":"2021-06-11","cited_by_count":1,"area":null},{"id":"2411.01115","title":"Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems","created":"2024-11-02","cited_by_count":1,"area":null},{"id":"2412.03332","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","created":"2024-12-04","cited_by_count":1,"area":null},{"id":"2402.13595","title":"A cutting plane algorithm for globally solving low dimensional k-means clustering problems","created":"2024-02-21","cited_by_count":0,"area":null},{"id":"2506.13533","title":"Learning Augmented Graph $k$-Clustering","created":"2025-06-16","cited_by_count":0,"area":null},{"id":"2609.07974","title":"A Sub-4 Approximation for Fair $k$-Means","created":"2026-09-07","cited_by_count":0,"area":null}],"next_cursor":null}