{"total":54,"rows":[{"id":"2106.12150","title":"Better Algorithms for Individually Fair $k$-Clustering","created":"2021-06-23","cited_by_count":28,"area":null},{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26,"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":"2104.09734","title":"Locally Private k-Means in One Round","created":"2021-04-20","cited_by_count":19,"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":"2112.14445","title":"Differentially-Private Clustering of Easy Instances","created":"2021-12-29","cited_by_count":17,"area":null},{"id":"2111.03193","title":"Explainable k-means. Don't be greedy, plant bigger trees!","created":"2021-11-04","cited_by_count":15,"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":"2106.15566","title":"Near-Optimal Explainable $k$-Means for All Dimensions","created":"2021-06-29","cited_by_count":13,"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":"2111.04804","title":"Approximating Fair Clustering with Cascaded Norm Objectives","created":"2021-11-08","cited_by_count":13,"area":null},{"id":"2105.03714","title":"Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted Partitions","created":"2021-05-08","cited_by_count":10,"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.01700","title":"Differentially Private Vertical Federated Clustering","created":"2022-08-02","cited_by_count":10,"area":null},{"id":"2210.17028","title":"Improved Learning-augmented Algorithms for k-means and k-medians Clustering","created":"2022-10-31","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":"2207.07949","title":"A Nearly Tight Analysis of Greedy k-means++","created":"2022-07-16","cited_by_count":7,"area":null},{"id":"2308.09701","title":"Do you know what q-means?","created":"2023-08-18","cited_by_count":6,"area":null},{"id":"2309.16384","title":"Multi-Swap $k$-Means++","created":"2023-09-28","cited_by_count":5,"area":null},{"id":"2312.11846","title":"Initializing Services in Interactive ML Systems for Diverse Users","created":"2023-12-19","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":"2208.09643","title":"The computational complexity of some explainable clustering problems","created":"2022-08-20","cited_by_count":4,"area":null},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","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":"2102.09101","title":"Online $k$-means Clustering on Arbitrary Data Streams","created":"2021-02-18","cited_by_count":2,"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":"2112.13751","title":"Differentially-Private Sublinear-Time Clustering","created":"2021-12-27","cited_by_count":2,"area":null},{"id":"2205.10403","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","created":"2022-05-20","cited_by_count":2,"area":null},{"id":"2207.01771","title":"A Generative Framework for Personalized Learning and Estimation: Theory, Algorithms, and Privacy","created":"2022-07-05","cited_by_count":2,"area":null},{"id":"2305.07316","title":"Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces","created":"2023-05-12","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":"2401.07091","title":"Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints","created":"2024-01-13","cited_by_count":2,"area":null},{"id":"2403.14332","title":"A Differentially Private Clustering Algorithm for Well-Clustered Graphs","created":"2024-03-21","cited_by_count":2,"area":null},{"id":"2601.16091","title":"Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals","created":"2026-01-22","cited_by_count":2,"area":null},{"id":"2106.12959","title":"Differentially Private Algorithms for Clustering with Stability Assumptions","created":"2021-06-11","cited_by_count":1,"area":null},{"id":"2201.13217","title":"Fast Distributed k-Means with a Small Number of Rounds","created":"2022-01-31","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":"2307.07449","title":"Differentially Private Clustering in Data Streams","created":"2023-07-14","cited_by_count":1,"area":null},{"id":"2408.10002","title":"The Fairness-Quality Trade-off in Clustering","created":"2024-08-19","cited_by_count":1,"area":null},{"id":"2512.15210","title":"Label-consistent clustering for evolving data","created":"2025-12-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":"2203.02005","title":"On consistency of constrained spectral clustering under representation-aware stochastic block model","created":"2022-03-03","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":"2212.01771","title":"Can Evolutionary Clustering Have Theoretical Guarantees?","created":"2022-12-04","cited_by_count":0,"area":null},{"id":"2402.13595","title":"A cutting plane algorithm for globally solving low dimensional k-means clustering problems","created":"2024-02-21","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":"2505.22991","title":"Number of Clusters in a Dataset: A Regularized K-means Approach","created":"2025-05-29","cited_by_count":0,"area":null},{"id":"2506.13533","title":"Learning Augmented Graph $k$-Clustering","created":"2025-06-16","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":"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},{"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}