Max-flow min-cut theorem in an anisotropic network
From MaRDI portal
Publication:2276860
zbMath0723.90020MaRDI QIDQ2276860
Publication date: 1990
Published in: Osaka Journal of Mathematics (Search for Journal in Brave)
Deterministic network models in operations research (90B10) Absolutely continuous real functions of several variables, functions of bounded variation (26B30)
Related Items
Riemannian and Lorentzian flow-cut theorems, Bit threads and holographic monogamy, Covariant bit threads, Maximal stream and minimal cutset for first passage percolation through a domain of \(\mathbb{R}^{d}\), Maximum Flows and Minimum Cuts in the Plane, Bit threads and holographic entanglement, Maximum flows and minimum cuts in the plane, Approximation of maximal Cheeger sets by projection, Towards a bit threads derivation of holographic entanglement of purification, Convex programs for minimal-area problems, Examples of max-flow and min-cut problems with duality gaps in continuous networks
