Login / Signup
An almost 2-approximation for all-pairs of shortest paths in subquadratic time.
Maor Akav
Liam Roditty
Published in:
SODA (2020)
Keyphrases
</>
shortest path
shortest path algorithm
shortest path problem
road network
weighted graph
pairwise
finding the shortest path
routing algorithm
optimal path
path length
travel time
minimum cost flow
geodesic distance
minimal surface
shortest distance
spatial networks
image segmentation