A Solution for Finding Quasi-Shortest Path with Graph Coarsening.
Takeaki IwataKeita KitauraRyotaro MatsuoHiroyuki OhsakiPublished in: ICOIN (2022)
Keyphrases
- shortest path
- finding the shortest path
- shortest path problem
- minimum spanning tree
- weighted graph
- path length
- flow graph
- edge weights
- steiner tree
- graph search
- shortest path algorithm
- routing algorithm
- tree width
- betweenness centrality
- graph partitioning
- strongly connected components
- road network
- lagrangian relaxation
- optimal path
- spanning tree
- graph model
- graph theory
- random walk
- optimal solution
- geodesic distance
- combinatorial optimization problems
- path selection
- travel time
- graph structure
- integer programming
- connected components
- path queries
- source node
- dijkstra algorithm