The paper claims a new tradeoff for 2-approximate all-pairs shortest paths, but the proof has a critical gap in the sampling-based base case.
Approximate distance oracles with constant query time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Improved 2-Approximate Shortest Paths for close vertex pairs
The paper claims a new tradeoff for 2-approximate all-pairs shortest paths, but the proof has a critical gap in the sampling-based base case.