{"total":19,"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":"2106.07239","title":"Fair Clustering Under a Bounded Cost","created":"2021-06-14","cited_by_count":21,"area":null},{"id":"2106.06755","title":"Tight FPT Approximation for Socially Fair Clustering","created":"2021-06-12","cited_by_count":10,"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":"2110.14242","title":"Tight FPT Approximation for Constrained k-Center and k-Supplier","created":"2021-10-27","cited_by_count":4,"area":null},{"id":"2202.01391","title":"Fair Representation Clustering with Several Protected Classes","created":"2022-02-03","cited_by_count":4,"area":null},{"id":"2404.01936","title":"Settling Time vs. Accuracy Tradeoffs for Clustering Big Data","created":"2024-04-02","cited_by_count":4,"area":null},{"id":"2112.03183","title":"Modification-Fair Cluster Editing","created":"2021-12-06","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":"2208.10095","title":"Socially Fair Center-based and Linear Subspace Clustering","created":"2022-08-22","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":"2302.03151","title":"Fair Minimum Representation Clustering","created":"2023-02-06","cited_by_count":0,"area":null},{"id":"2302.11295","title":"Fair Correlation Clustering in Forests","created":"2023-02-22","cited_by_count":0,"area":null},{"id":"2305.16890","title":"Universal Weak Coreset","created":"2023-05-26","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":"2409.02963","title":"Fair Clustering with Minimum Representation Constraints","created":"2024-09-04","cited_by_count":0,"area":null},{"id":"2505.06259","title":"Fair Clustering with Clusterlets","created":"2025-05-03","cited_by_count":0,"area":null},{"id":"2605.00185","title":"Fair Dataset Distillation via Cross-Group Barycenter Alignment","created":"2026-04-30","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}