Login / Signup

(1+ε)-Approximate Shortest Paths in Dynamic Streams.

Michael ElkinChhaya Trehan
Published in: APPROX/RANDOM (2022)
Keyphrases
  • shortest path
  • shortest path algorithm
  • shortest path problem
  • road network
  • geodesic distance
  • data streams
  • finding the shortest path
  • dynamic environments
  • routing algorithm
  • weighted graph
  • path length
  • minimum length