New deterministic and randomized algorithms achieve near-linear-time constant-factor approximations for k-center and (k,z)-clustering on graphs, resolving an open problem of Abboud et al.
On the fine- grained complexity of approximating k-center in sparse graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Faster Randomized and Deterministic k-Clustering on Graphs
New deterministic and randomized algorithms achieve near-linear-time constant-factor approximations for k-center and (k,z)-clustering on graphs, resolving an open problem of Abboud et al.