8 citations · 30 across the 29 of their papers we have counts for
1 paper · 2 filters
Patrick Briest, Sanjeev Khanna
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may…