Login / Signup
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Lyudmil Aleksandrov
Hristo N. Djidjev
Anil Maheshwari
Jörg-Rüdiger Sack
Published in:
CoRR (2011)
Keyphrases
</>
shortest path
shortest path problem
shortest path algorithm
optimal path
path length
dynamic programming
finding the shortest path
approximation algorithms
minimum cost flow
distance metric
distance transform
weighted graph
flow graph
strongly connected components