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:
Discret. Comput. Geom. (2013)
Keyphrases
</>
shortest path
weighted graph
shortest path problem
dynamic programming
optimal solution
finding the shortest path
optimal path
geodesic distance
simulated annealing
expectation maximization
shortest path algorithm
strongly connected components