Login / Signup

A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs.

Philip N. KleinSairam Subramanian
Published in: Algorithmica (1998)
Keyphrases
  • shortest path
  • planar graphs
  • shortest path algorithm
  • polynomial time approximation
  • closed form
  • road network
  • travel time
  • weighted graph
  • finding the shortest path
  • special case
  • geodesic distance
  • partition function