{"total":13,"rows":[{"id":"2106.15566","title":"Near-Optimal Explainable $k$-Means for All Dimensions","created":"2021-06-29","cited_by_count":13,"area":null},{"id":"2107.01804","title":"Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering","created":"2021-07-05","cited_by_count":6,"area":null},{"id":"2304.03146","title":"Parameterized Approximation Schemes for Clustering with General Norm Objectives","created":"2023-04-06","cited_by_count":5,"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":"2310.16752","title":"Simple, Scalable and Effective Clustering via One-Dimensional Projections","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2305.02850","title":"Impossibility of Depth Reduction in Explainable Clustering","created":"2023-05-04","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":"2404.17152","title":"CSCO: Connectivity Search of Convolutional Operators","created":"2024-04-26","cited_by_count":0,"area":null},{"id":"2405.15983","title":"Hierarchical Clustering via Local Search","created":"2024-05-24","cited_by_count":0,"area":null},{"id":"2502.06163","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2510.03143","title":"The Computational Complexity of Almost Stable Clustering with Penalties","created":"2025-10-03","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}