An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.
Lyudmil AleksandrovMark LanthierAnil MaheshwariJörg-Rüdiger SackPublished in: SWAT (1998)
Keyphrases
- shortest path
- weighted graph
- minimal surface
- shortest path algorithm
- shortest path problem
- road network
- convex sets
- betweenness centrality
- path length
- edge weights
- finding the shortest path
- shortest distance
- optimal path
- travel time
- flow graph
- geodesic distance
- approximation algorithms
- high dimensional
- line drawings
- convex hull
- minimum cost flow
- complex networks
- special case