A (2+ε)-approximation algorithm for metric k-median using modified greedy phases and sampling on stable instances.
Near-linear time approximations schemes for clustering in doubling metrics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
A (2+ε)-approximation algorithm for metric k-median using modified greedy phases and sampling on stable instances.