Maximum flows and minimum cuts in the plane

DOI10.1007/S10898-009-9471-6MaRDI QIDQ989897zbMATH OpenOpenAlexFDO

Authors Gilbert Strang

Publication date 23 August 2010

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/116027

zbMATH Keywords

maximum flowminimum cutcapacity constraintCheeger

Mathematics Subject Classification ID

PDEs in connection with control and optimization (35Q93) Linear optimal control problems (49N05) Duality theory (optimization) (49N15)

Recommendations

• Maximum flows and minimum cuts in the plane
• On maximum flows in polyhedral domains
• A measure-theoretical max-flow-min-cut problem
• Max-flow min-cut theorem in an anisotropic network
• Examples of max-flow and min-cut problems with duality gaps in continuous networks

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3938692 (Why is no real title available?)
• scientific article; zbMATH DE number 3675400 (Why is no real title available?)
• scientific article; zbMATH DE number 1033260 (Why is no real title available?)
• scientific article; zbMATH DE number 1909499 (Why is no real title available?)
• scientific article; zbMATH DE number 860019 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3337135 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• An integral formula for total gradient variation
• Analysis of an inverse problem arising in photolithography
• Discrete Approximations to Continuum Optimal Flow Problems
• Dual spaces of stresses and strains, with applications to Hencky plasticity
• Duality theorems for a continuous analog of Ford-Fulkerson flows in networks
• Eigenvalues and expanders
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• Geometric bounds for eigenvalues of Markov chains
• Laplacians and the Cheeger inequality for directed graphs
• Max-flow min-cut theorem in an anisotropic network
• Maximal Flow Through a Network
• Maximal flow through a domain
• Maximum area with Minkowski measures of perimeter
• The Isoperimetric Problem in the Minkowski Plane
• The first eigenvalue of the Laplacian, isoperimetric constants, and the max flow min cut theorem

Cited in

(17)

• The Cheeger cut and Cheeger problem in metric measure spaces
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Approximation of maximal Cheeger sets by projection
• scientific article; zbMATH DE number 45022 (Why is no real title available?)
• An introduction to continuous optimization for imaging
• The Cheeger cut and Cheeger problem in metric graphs
• Geometric criteria for the existence of capillary surfaces in tubes
• An overview on the Cheeger problem
• Lattices with finite renormalized Coulombian interaction energy in the plane
• Maximum cuts for a minimum flow
• Discrete Approximations to Continuum Optimal Flow Problems
• On maximum flows in polyhedral domains
• scientific article; zbMATH DE number 4001832 (Why is no real title available?)
• Optimal geometric flows via dual programs
• On the Cheeger sets in strips and non-convex domains
• Maximum flows and minimum cuts in the plane
• Combinatorial continuous maximum flow

Describes a project that uses

Uses Software

• MAXFLOW

This page was built for publication: Maximum flows and minimum cuts in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989897)