Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization.
Pierre LeleuxSylvain CourtainGuillaume GuexMarco SaerensPublished in: CoRR (2020)
Keyphrases
- shortest path
- routing algorithm
- shortest path problem
- routing problem
- dijkstra algorithm
- information theory
- road network
- optimal path
- high dimensional
- shortest path algorithm
- sparse representation
- path length
- minimum cost flow
- finding the shortest path
- shortest distance
- spatial networks
- travel time
- weighted graph
- flow graph
- network routing
- betweenness centrality