Three new algorithms construct (2k-1)-stretch distance oracles with O(n^{1+1/k}) space in improved subquadratic or near-linear time for various k and graph densities.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
Three new algorithms construct (2k-1)-stretch distance oracles with O(n^{1+1/k}) space in improved subquadratic or near-linear time for various k and graph densities.