Quadtrees and related structures are 2-Presortable, admitting expected O(n sqrt(log n)) algorithms given presorts along both axes.
Fredman , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
citing papers explorer
-
The Presort Hierarchy for Geometric Problems
Quadtrees and related structures are 2-Presortable, admitting expected O(n sqrt(log n)) algorithms given presorts along both axes.
-
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.