On short paths interdiction problems: Total and node-wise limited interdiction
type: Item
instance of: scholarly article
title: On short paths interdiction problems: Total and node-wise limited interdiction
zbMATH Open document ID: 1148.68036
author: Endre Boros
author: Konrad Borys
author: Vladimir Gurvich
author: Jihui Zhao
author: Khaled Elbassioni
author: Gábor Rudolf
published in: Theory of Computing Systems
publication date: 2008-06-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5288688
zbMATH Keywords: Approximation algorithm
zbMATH Keywords: Dijkstra's algorithm
zbMATH Keywords: Most vital arcs problem
zbMATH Keywords: Cyclic game
zbMATH Keywords: Maxmin mean cycle
zbMATH Keywords: Minimal vertex cover
zbMATH Keywords: Network inhibition
zbMATH Keywords: Network interdiction
MaRDI profile type: Publication
full work available at URL: s00224-007-9025-6
OpenAlex ID: W2121815516
cites work: Q3056948
cites work: Finding the most vital arcs in a network
cites work: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
cites work: Most vital links and nodes in weighted networks
cites work: On the hardness of approximating minimum vertex cover
cites work: Interpolation of functions over a measure space and conjectures about memory
cites work: Positional strategies for mean payoff games
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Maximum-Minimum Sätze über Graphen
cites work: Q4198056
cites work: Optimal interdiction policy for a flow network
cites work: A problem in network interdiction
cites work: Q4128417
cites work: Q4843270
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: Q4526964
cites work: Shortest-path network interdiction
cites work: A deterministic subexponential algorithm for solving parity games
cites work: Automata, Languages and Programming
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Cyclical games with prohibitions
cites work: The k most vital arcs in the shortest path problem
cites work: Optimal interdiction of a supply network
cites work: Q4117607
cites work: Extensions of two person zero sum games
cites work: The network inhibition problem
cites work: Mean cost cyclical games
cites work: Q4770411
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4782696
cites work: Disjoint (s, t)‐cuts in a network
cites work: Two-Person Zero-Sum Games for Network Interdiction
cites work: Deterministic network interdiction
cites work: The complexity of mean payoff games on graphs
DOI: 10.1007/S00224-007-9025-6
description: scientific article; zbMATH DE number 5288688