{"total":26,"rows":[{"id":"2106.12150","title":"Better Algorithms for Individually Fair $k$-Clustering","created":"2021-06-23","cited_by_count":28,"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":"2106.07239","title":"Fair Clustering Under a Bounded Cost","created":"2021-06-14","cited_by_count":21,"area":null},{"id":"2302.10359","title":"Replicable Clustering","created":"2023-02-20","cited_by_count":19,"area":null},{"id":"2103.02013","title":"Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints","created":"2021-03-02","cited_by_count":17,"area":null},{"id":"2106.16147","title":"Nearly-Tight and Oblivious Algorithms for Explainable Clustering","created":"2021-06-30","cited_by_count":17,"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":"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":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","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":"2409.00743","title":"Interpretable Clustering: A Survey","created":"2024-09-01","cited_by_count":8,"area":null},{"id":"2109.00708","title":"Efficient Algorithms For Fair Clustering with a New Fairness Notion","created":"2021-09-02","cited_by_count":5,"area":null},{"id":"2206.12895","title":"$k$-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy","created":"2022-06-26","cited_by_count":4,"area":null},{"id":"2401.05502","title":"Diversity-aware clustering: Computational Complexity and Approximation Algorithms","created":"2024-01-10","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":"2107.00957","title":"Ascent Similarity Caching with Approximate Indexes","created":"2021-07-02","cited_by_count":2,"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":"2408.10002","title":"The Fairness-Quality Trade-off in Clustering","created":"2024-08-19","cited_by_count":1,"area":null},{"id":"2410.24104","title":"Clustering to Minimize Cluster-Aware Norm Objectives","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2212.01771","title":"Can Evolutionary Clustering Have Theoretical Guarantees?","created":"2022-12-04","cited_by_count":0,"area":null},{"id":"2405.10378","title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","created":"2024-05-16","cited_by_count":0,"area":null},{"id":"2512.06211","title":"A Broader View on Clustering under Cluster-Aware Norm Objectives","created":"2025-12-05","cited_by_count":0,"area":null},{"id":"2512.19654","title":"Clustering with Label Consistency","created":"2025-12-22","cited_by_count":0,"area":null},{"id":"2607.13217","title":"Hierarchical $\\mathcal{F}$-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs","created":"2026-07-14","cited_by_count":0,"area":null}],"next_cursor":null}