This is a preview. Log in through your library . Abstract We consider variants of the max-flow min-cut problems in the plane, motivated by models of damage, where certain sets of edges of the graph ...

In the "classical" network flow model, flows are constrained by the capacities of individual arcs. In the "polymatroidal" network flow model introduced in this paper, flows are constrained by the ...