2 citations · 4 across the 7 of their papers we have counts for
1 paper · 1 filter
Dorothee Henke, Lasse Wulf
We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our pr…