New hierarchical and parameterized distance oracles give the first truly subquadratic-time construction of (2k-1)-stretch oracles for every k≥3.
Approximate distance oracles with improved bounds
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
-
Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
New hierarchical and parameterized distance oracles give the first truly subquadratic-time construction of (2k-1)-stretch oracles for every k≥3.