Bounded-degree light approximate shortest-path trees in doubling metrics.
Joachim GudmundssonJulián MestreSeeun William UmbohPublished in: Discret. Appl. Math. (2021)
Keyphrases
- shortest path
- bounded degree
- graph theoretic
- shortest path problem
- shortest path algorithm
- weighted graph
- road network
- path length
- steiner tree
- routing algorithm
- shortest distance
- bounded treewidth
- travel time
- flow graph
- optimal path
- finding the shortest path
- minimum spanning tree
- data model
- edge weights
- data management
- nearest neighbor