Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
Permutation classes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The price of incrementality in k-center clustering
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.