New dynamic algorithms for shortest path tree computation.
Paolo NarváezKai-Yeung SiuHong-Yi TzengPublished in: IEEE/ACM Trans. Netw. (2000)
Keyphrases
- shortest path
- shortest path algorithm
- shortest path problem
- minimum cost flow
- dynamic environments
- minimum spanning tree
- optimization problems
- road network
- travel time
- routing algorithm
- betweenness centrality
- graph theory
- graph search
- collision free
- combinatorial optimization
- steiner tree
- nearest neighbor
- strongly connected components