Some Generalized Max-Flow Min-Cut Problems in the Plane

DOI10.1287/MOOR.16.2.310zbMath0747.90036OpenAlexW2031946689MaRDI QIDQ3978618

Bienstock, Daniel

Publication date: 25 June 1992

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.16.2.310

zbMATH Keywords

polynomial algorithmplanar graphnetwork survivabilitymax-flow min-cutdamages\(\mathcal NP\)-completenessmax linkage problemmin-break problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (2)

Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network ⋮ On multi-path routing for reliable communications in failure interdependent complex networks

This page was built for publication: Some Generalized Max-Flow Min-Cut Problems in the Plane