A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem.
Pham Dinh ThanhHuynh Thi Thanh BinhDo Dinh DacNguyen Binh LongLe Minh Hai PhongPublished in: CoRR (2020)
Keyphrases
- shortest path
- greedy algorithms
- greedy algorithm
- minimum spanning tree
- shortest path problem
- knapsack problem
- shortest path algorithm
- weighted graph
- routing algorithm
- optimal path
- tree structure
- road network
- multicast tree
- steiner tree
- path length
- travel time
- dijkstra algorithm
- flow graph
- path selection
- search algorithm
- optimal solution
- shortest distance
- spanning tree
- minimal surface
- geodesic distance
- index structure
- worst case
- objective function
- strongly connected components
- reinforcement learning
- minimum cost flow
- tree search
- edge weights
- dynamic programming