{"total":52,"rows":[{"id":"2106.14043","title":"Improved Approximation Algorithms for Individually Fair Clustering","created":"2021-06-26","cited_by_count":33,"area":null},{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26,"area":null},{"id":"2103.02512","title":"Approximation Algorithms for Socially Fair Clustering","created":"2021-03-03","cited_by_count":25,"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":"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":"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":"2110.08991","title":"Dimensionality Reduction for Wasserstein Barycenter","created":"2021-10-18","cited_by_count":13,"area":null},{"id":"2103.00564","title":"An Introduction to Johnson-Lindenstrauss Transforms","created":"2021-02-28","cited_by_count":11,"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":"2306.06778","title":"Approximation Algorithms for Fair Range Clustering","created":"2023-06-11","cited_by_count":10,"area":null},{"id":"2403.08917","title":"Efficiently Computing Similarities to Private Datasets","created":"2024-03-13","cited_by_count":9,"area":null},{"id":"2402.06730","title":"A Scalable Algorithm for Individually Fair K-means Clustering","created":"2024-02-09","cited_by_count":8,"area":null},{"id":"2207.00966","title":"An Empirical Evaluation of $k$-Means Coresets","created":"2022-07-03","cited_by_count":7,"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":"2309.16384","title":"Multi-Swap $k$-Means++","created":"2023-09-28","cited_by_count":5,"area":null},{"id":"2310.10939","title":"Fast and Simple Spectral Clustering in Theory and Practice","created":"2023-10-17","cited_by_count":5,"area":null},{"id":"2108.05767","title":"Probabilistic methods for approximate archetypal analysis","created":"2021-08-12","cited_by_count":4,"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":"2306.09977","title":"Adversarially robust clustering with optimality guarantees","created":"2023-06-16","cited_by_count":4,"area":null},{"id":"2310.09127","title":"On Generalization Bounds for Projective Clustering","created":"2023-10-13","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":"2501.06588","title":"A Tight VC-Dimension Analysis of Clustering Coresets with Applications","created":"2025-01-11","cited_by_count":4,"area":null},{"id":"2211.09776","title":"Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues","created":"2022-11-17","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":"2210.00244","title":"On The Relative Error of Random Fourier Features for Preserving Kernel Distance","created":"2022-10-01","cited_by_count":2,"area":null},{"id":"2307.03430","title":"Differential Privacy for Clustering Under Continual Observation","created":"2023-07-07","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":"2510.03021","title":"Differentially Private Wasserstein Barycenters","created":"2025-10-03","cited_by_count":2,"area":null},{"id":"2105.15007","title":"Locally Private $k$-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error","created":"2021-05-31","cited_by_count":1,"area":null},{"id":"2202.10815","title":"Robust and Provable Guarantees for Sparse Random Embeddings","created":"2022-02-22","cited_by_count":1,"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":"2303.16841","title":"Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees","created":"2023-03-29","cited_by_count":1,"area":null},{"id":"2312.15762","title":"On Robust Wasserstein Barycenter: The Model and Algorithm","created":"2023-12-25","cited_by_count":1,"area":null},{"id":"2406.04610","title":"Contrastive Explainable Clustering with Differential Privacy","created":"2024-06-07","cited_by_count":1,"area":null},{"id":"2406.11649","title":"Making Old Things New: A Unified Algorithm for Differentially Private Clustering","created":"2024-06-17","cited_by_count":1,"area":null},{"id":"2102.04282","title":"Communication-efficient k-Means for Edge-based Machine Learning","created":"2021-02-08","cited_by_count":0,"area":null},{"id":"2104.05628","title":"Confidence-Optimal Random Embeddings","created":"2021-04-06","cited_by_count":0,"area":null},{"id":"2206.02334","title":"Hashing Learning with Hyper-Class Representation","created":"2022-06-06","cited_by_count":0,"area":null},{"id":"2211.08184","title":"Improved Coresets for Euclidean $k$-Means","created":"2022-11-15","cited_by_count":0,"area":null},{"id":"2303.11774","title":"Exact Non-Oblivious Performance of Rademacher Random Embeddings","created":"2023-03-21","cited_by_count":0,"area":null},{"id":"2306.06611","title":"Learning the Positions in CountSketch","created":"2023-06-11","cited_by_count":0,"area":null},{"id":"2310.19068","title":"Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming","created":"2023-10-29","cited_by_count":0,"area":null},{"id":"2404.10148","title":"Node Similarities under Random Projections: Limits and Pathological Cases","created":"2024-04-15","cited_by_count":0,"area":null},{"id":"2406.02432","title":"Coresets for Multiple $\\ell_p$ Regression","created":"2024-06-04","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":"2502.19865","title":"Beyond Worst-Case Dimensionality Reduction for Sparse Vectors","created":"2025-02-27","cited_by_count":0,"area":null},{"id":"2506.00165","title":"Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2509.06214","title":"Metric Embedding Initialization-Based Differentially Private and Explainable Graph Clustering","created":"2025-09-07","cited_by_count":0,"area":null}],"next_cursor":null}