This preview shows page 1. Sign up to view the full content.
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 efcient 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
This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
 Fall '08
 Chekuri,C
 Algorithms

Click to edit the document details