Length-Bounded Cuts and Flows
From MaRDI portal
Publication:3613800
DOI10.1007/11786986_59zbMath1223.05294OpenAlexW1595120036MaRDI QIDQ3613800
Heiko Schilling, Ekkehard Köhler, Georg Baier, Martin Skutella, Alexander Hall, Erlebach, Thomas
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_59
Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40) Flows in graphs (05C21)
Related Items
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation, An extended network interdiction problem for optimal toll control, Unnamed Item, Edge degeneracy: algorithmic and structural results, Approximability of the firefighter problem. Computing cuts over time, Rerouting Flows when Links Fail, Paths of bounded length and their cuts: parameterized complexity and algorithms, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, Searching for a Visible, Lazy Fugitive, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms, Flows with unit path capacities and related packing and covering problems
