{"total":14,"rows":[{"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":"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.00774","title":"Almost Tight Approximation Algorithms for Explainable Clustering","created":"2021-07-01","cited_by_count":12,"area":null},{"id":"2206.08646","title":"Scalable Differentially Private Clustering via Hierarchically Separated Trees","created":"2022-06-17","cited_by_count":10,"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":"2107.01804","title":"Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering","created":"2021-07-05","cited_by_count":6,"area":null},{"id":"2306.02826","title":"Near-Optimal Quantum Coreset Construction Algorithms for Clustering","created":"2023-06-05","cited_by_count":6,"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":"2210.04249","title":"Coresets for Relational Data and The Applications","created":"2022-10-09","cited_by_count":1,"area":null},{"id":"2305.02850","title":"Impossibility of Depth Reduction in Explainable Clustering","created":"2023-05-04","cited_by_count":1,"area":null},{"id":"2201.02448","title":"k-Center Clustering with Outliers in Sliding Windows","created":"2022-01-07","cited_by_count":0,"area":null},{"id":"2202.08173","title":"Distributed k-Means with Outliers in General Metrics","created":"2022-02-16","cited_by_count":0,"area":null},{"id":"2407.11217","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","created":"2024-07-15","cited_by_count":0,"area":null},{"id":"2603.10721","title":"Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions","created":"2026-03-11","cited_by_count":0,"area":null}],"next_cursor":null}