On approximating shortest paths in weighted triangular tessellations.
Prosenjit BoseGuillermo EstebanDavid OrdenRodrigo I. SilveiraPublished in: Artif. Intell. (2023)
Keyphrases
- shortest path
- weighted graph
- shortest path problem
- shortest path algorithm
- road network
- betweenness centrality
- edge weights
- finding the shortest path
- path length
- travel time
- flow graph
- minimum cost flow
- strongly connected components
- routing algorithm
- geodesic distance
- shortest distance
- spanning tree
- bi objective
- minimal surface
- social network analysis
- random walk
- high dimensional