Maximum flows and minimum cuts in the plane
From MaRDI portal
Publication:989897
DOI10.1007/s10898-009-9471-6zbMath1207.49042OpenAlexW2088979591MaRDI QIDQ989897
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
Duality theory (optimization) (49N15) Linear optimal control problems (49N05) PDEs in connection with control and optimization (35Q93)
Related Items
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, An Overview on the Cheeger Problem, The Cheeger cut and Cheeger problem in metric graphs, The Cheeger cut and Cheeger problem in metric measure spaces, Lattices with finite renormalized Coulombian interaction energy in the plane, An introduction to continuous optimization for imaging, Approximation of maximal Cheeger sets by projection, On the Cheeger sets in strips and non-convex domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An integral formula for total gradient variation
- Dual spaces of stresses and strains, with applications to Hencky plasticity
- Geometric bounds for eigenvalues of Markov chains
- Eigenvalues and expanders
- Examples of max-flow and min-cut problems with duality gaps in continuous networks
- Duality theorems for a continuous analog of Ford-Fulkerson flows in networks
- Laplacians and the Cheeger inequality for directed graphs
- Max-flow min-cut theorem in an anisotropic network
- The first eigenvalue of the Laplacian, isoperimetric constants, and the max flow min cut theorem
- ANALYSIS OF AN INVERSE PROBLEM ARISING IN PHOTOLITHOGRAPHY
- Maximal Flow Through a Network
- Discrete Approximations to Continuum Optimal Flow Problems
- Maximal flow through a domain
- Maximum area with Minkowski measures of perimeter
- The Isoperimetric Problem in the Minkowski Plane
