152 citations · 329 across the 9 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2020★ 6 cited
Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
Pierre Leleux, Sylvain Courtain, Guillaume Guex +1
This work elaborates on the important problem of (1) designing optimal randomized routing policies for reaching a target node t from a source note s on a weighted directed graph G…
cs.LG2019★ 13 cited
Randomized Shortest Paths with Net Flows and Capacity Constraints
Sylvain Courtain, Pierre Leleux, Ilkka Kivimaki +2
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement…