Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques.
Daniel BahrdtStefan FunkeSokol MakolliClaudius ProisslPublished in: ALENEX (2022)
Keyphrases
- shortest path
- shortest distance
- path length
- geodesic distance
- shortest path problem
- search algorithm
- road network
- shortest path algorithm
- travel time
- dynamic programming
- dijkstra algorithm
- distance transformation
- routing algorithm
- optimal path
- graph search
- minimum cost flow
- minimal surface
- path selection
- steiner tree
- nearest neighbor search
- neighborhood sequences
- distance measure
- strongly connected components