Sparse randomized shortest paths routing with Tsallis divergence regularization.
Pierre LeleuxSylvain CourtainGuillaume GuexMarco SaerensPublished in: Data Min. Knowl. Discov. (2021)
Keyphrases
- shortest path
- routing algorithm
- shortest path problem
- shortest path algorithm
- dijkstra algorithm
- routing problem
- road network
- shortest distance
- geodesic distance
- information theory
- weighted graph
- path length
- flow graph
- finding the shortest path
- travel time
- sparse representation
- level set
- optimal path
- minimum cost flow
- ad hoc networks