18 citations · 20 across the 7 of their papers we have counts for
1 paper · 1 filter
Nassim Dehouche
We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively seek a shorte…