Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback