Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs.
Aaron BernsteinPublished in: SODA (2012)
Keyphrases
- shortest path
- undirected graph
- approximation algorithms
- worst case
- shortest path algorithm
- shortest path problem
- minimum length
- directed graph
- weighted graph
- directed acyclic graph
- road network
- finding the shortest path
- minimum cost
- np hard
- optimal path
- routing algorithm
- path length
- special case
- spanning tree
- connected components
- edge weights
- disjoint paths
- minimum cost flow
- complex networks
- graph structure
- multicommodity flow
- spatial networks
- minimal surface
- flow graph
- dynamic programming
- graphical models
- travel time