dc.contributor.author | Strang, Gilbert | |
dc.date.accessioned | 2018-05-31T17:46:39Z | |
dc.date.available | 2018-05-31T17:46:39Z | |
dc.date.issued | 2009-09 | |
dc.identifier.issn | 0925-5001 | |
dc.identifier.issn | 1573-2916 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/116027 | |
dc.description.abstract | A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint ||(v[subscript 1], v[subscript 2])|| ≤ c(x, y). The dual problem finds a minimum cut ∂ S which is filled to capacity by the flow through it. This model problem has found increasing application in medical imaging, and the theory continues to develop (along with new algorithms). Remaining difficulties include explicit streamlines for the maximum flow, and constraints that are analogous to a directed graph. Keywords: Maximum flow; Minimum cut; Capacity constraint; Cheeger | en_US |
dc.publisher | Springer-Verlag | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/s10898-009-9471-6 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT Web Domain | en_US |
dc.title | Maximum flows and minimum cuts in the plane | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Strang, Gilbert. “Maximum Flows and Minimum Cuts in the Plane.” Journal of Global Optimization 47, 3 (September 2009): 527–535 © 2009 Springer Science+Business Media | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.contributor.mitauthor | Strang, Gilbert | |
dc.relation.journal | Journal of Global Optimization | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2018-05-30T18:07:01Z | |
dspace.orderedauthors | Strang, Gilbert | en_US |
dspace.embargo.terms | N | en_US |
mit.license | OPEN_ACCESS_POLICY | en_US |