Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
Searching dynamic point sets in spaces with bounded doubling dimension
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Approximate distance oracles and ANN structures for short Fréchet queries on curves achieve space O((k log(1/ε) ε^{-d})^k) independent of input size N with O(k^2) query time.
citing papers explorer
-
Sublinear data structures for short Fr\'echet queries
Approximate distance oracles and ANN structures for short Fréchet queries on curves achieve space O((k log(1/ε) ε^{-d})^k) independent of input size N with O(k^2) query time.