Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Coresets for Clustering with Capacity and Fairness Constraints

Published 22 Feb 2023 in cs.DS and cs.CG | (2302.11151v2)

Abstract: We study coresets for clustering with capacity and fairness constraints. Our main result is a near-linear time algorithm to construct O~(k2ε−2z−2)\tilde{O}(k^2\varepsilon^{-2z-2})-sized ε\varepsilon-coresets for capacitated (k,z)(k,z)-clustering which improves a recent O~(k3ε−3z−2)\tilde{O}(k^3\varepsilon^{-3z-2}) bound by [BCAJ+22, HJLW23]. As a corollary, we also save a factor of kε−zk \varepsilon^{-z} on the coreset size for fair (k,z)(k,z)-clustering compared to them. We fundamentally improve the hierarchical uniform sampling framework of [BCAJ+22] by adaptively selecting sample size on each ring instance, proportional to its clustering cost to an optimal solution. Our analysis relies on a key geometric observation that reduces the number of total effective centers" from [BCAJ+22]'s O~(k2ε−z)\tilde{O}(k^2\varepsilon^{-z}) to merely O(klog⁡ε−1)O(k\log \varepsilon^{-1}) by being able toignore'' all center points that are too far or too close to the ring center.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.