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 can be simultaneously removed, rather than one edge at a ...