Unformatted text preview: 3. Let G = ( V , E ) be a graph. For each edge e let d ( e ) be a demand value attached to it. A ﬂow is feasible if it sends more than d ( e ) through e . Assume you have an oracle that is capable of solving the maximum ﬂow problem. Give efﬁcient algorithms for the following problems that call the oracle at most once. (a) Find a feasible ﬂow. (b) Find a feasible ﬂow of minimum possible value. 1...
View
Full Document
 Fall '08
 Chekuri,C
 Algorithms, Graph Theory, two MIN

Click to edit the document details