Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds
Lingxiao Huang, Jian Li, Pinyan Lu, Xuan Wu

TL;DR
This paper develops new coresets for constrained clustering problems, including capacity and fairness constraints, achieving smaller sizes and broader applicability than previous methods.
Contribution
It introduces a general framework for coresets under assignment constraints, improving size bounds and extending to fault-tolerant clustering across various metric spaces.
Findings
First $ ilde{O}(m + k^2 ext{poly}(rac{1}{ ext{epsilon}}))$ coreset for capacitated and fair $k$-Median with outliers.
Improved size bounds over prior work for constrained clustering problems.
Extended coresets to fault-tolerant clustering in diverse metric spaces.
Abstract
Designing small-sized \emph{coresets}, which approximately preserve the costs of the solutions for large datasets, has been an important research direction for the past decade. We consider coreset construction for a variety of general constrained clustering problems. We introduce a general class of assignment constraints, including capacity constraints on cluster centers, and assignment structure constraints for data points (modeled by a convex body ). We give coresets for clustering problems with such general assignment constraints that significantly generalize and improve known results. Notable implications include the first -coreset for capacitated and fair -Median with outliers in Euclidean spaces whose size is , generalizing and improving upon the prior bounds in [Braverman et al., FOCS' 22; Huang et al., ICLR'…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFacility Location and Emergency Management · Municipal Solid Waste Management
