Papers › A Composable Coreset for k-Center in Doubling Metrics
A Composable Coreset for k-Center in Doubling Metrics
Sepideh Aghamolaei, Mohammad Ghodsi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A set of points P in a metric space and a constant integer k are given. The k-center problem finds k points as centers among P, such that the maximum distance of any point of P to their closest centers (r) is minimized. Doubling metrics are metric spaces in which for any r, a ball of radius r can be covered using a constant number of balls of radius r/2. Fixed dimensional Euclidean spaces are doubling metrics. The lower bound on the approximation factor of k-center is $1.822$ in Euclidean spaces, however, (1+ϵ)-approximation algorithms with exponential dependency on 1/ϵ and k exist. For a given set of sets P₁,…,P_L, a composable coreset independently computes subsets C₁⊂P₁, …, C_L⊂P_L, such that ∪ᵢ₌₁ᴸ Cᵢ contains an approximation of a measure of the set ∪ᵢ₌₁ᴸ Pᵢ. We introduce a (1+ϵ)-approximation composable coreset for k-center, which in doubling metrics has size sublinear in |P|. This results in a (2+ϵ)-approximation algorithm for k-center in MapReduce with a constant number of rounds in doubling metrics for any ϵ>0 and sublinear communications, which is based on parametric pruning. We prove the exponential nature of the trade-off between the number of centers (k) and the radius (r), and give a composable coreset for a related problem called dual clustering. Also, we give a new version of the parametric pruning algorithm with O(nk/ϵ) running time, O(n) space and 2+ϵ approximation factor for metric k-center.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections