{"total":25,"rows":[{"id":"2106.14043","title":"Improved Approximation Algorithms for Individually Fair Clustering","created":"2021-06-26","cited_by_count":33,"area":null},{"id":"2103.02512","title":"Approximation Algorithms for Socially Fair Clustering","created":"2021-03-03","cited_by_count":25,"area":null},{"id":"2112.06580","title":"How to Find a Good Explanation for Clustering?","created":"2021-12-13","cited_by_count":16,"area":null},{"id":"2106.06755","title":"Tight FPT Approximation for Socially Fair Clustering","created":"2021-06-12","cited_by_count":10,"area":null},{"id":"2306.06778","title":"Approximation Algorithms for Fair Range Clustering","created":"2023-06-11","cited_by_count":10,"area":null},{"id":"2206.11210","title":"Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering","created":"2022-06-22","cited_by_count":8,"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":"2107.12490","title":"LEGATO: A LayerwisE Gradient AggregaTiOn Algorithm for Mitigating Byzantine Attacks in Federated Learning","created":"2021-07-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":"2404.13401","title":"Approximate Algorithms For $k$-Sparse Wasserstein Barycenter With Outliers","created":"2024-04-20","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":"2309.02710","title":"Improved Outlier Robust Seeding for k-means","created":"2023-09-06","cited_by_count":2,"area":null},{"id":"2103.00558","title":"Is Simple Uniform Sampling Effective for Center-Based Clustering with Outliers: When and Why?","created":"2021-02-28","cited_by_count":1,"area":null},{"id":"2301.02814","title":"Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers","created":"2023-01-07","cited_by_count":1,"area":null},{"id":"2403.10365","title":"Scalable Algorithms for Individual Preference Stable Clustering","created":"2024-03-15","cited_by_count":1,"area":null},{"id":"2406.15960","title":"Fair Clustering: Critique, Caveats, and Future Directions","created":"2024-06-22","cited_by_count":1,"area":null},{"id":"2412.10923","title":"Linear Programming based Approximation to Individually Fair k-Clustering with Outliers","created":"2024-12-14","cited_by_count":1,"area":null},{"id":"2604.16061","title":"Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means","created":"2026-04-17","cited_by_count":1,"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":"2210.01888","title":"Bicriteria Approximation Algorithms for Priority Matroid Median","created":"2022-10-04","cited_by_count":0,"area":null},{"id":"2403.12181","title":"MAC Advice for Facility Location Mechanism Design","created":"2024-03-18","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":"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":"2605.07130","title":"Simple KNN-Based Outlier Detection Achieves Robust Clustering","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2608.23295","title":"What Memory Composition Does Not Tell Us About Anomaly Detection","created":"2026-08-24","cited_by_count":0,"area":null}],"next_cursor":null}