Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
From MaRDI portal
Publication:3434697
DOI10.1007/11753728_24zbMath1185.90198MaRDI QIDQ3434697
Jihui Zhao, Leonid G. Khachiyan, Vladimir A. Gurvich
Publication date: 2 May 2007
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11753728_24
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
91A43: Games involving graphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Maximum Capacity Path Interdiction Problem with Fixed Costs, Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire, A nested family of \(k\)-total effective rewards for positional games, Matching interdiction, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Cyclic games and linear programming, Scientific contributions of Leo Khachiyan (a short overview), On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost