Com S 511: Homework #2
Due on Friday, September 18, 2009
Yuheng Long
1
Yuheng Long
Com S 511 : Homework #2
Problem 1
Problem 1
(a) It is suce to show that the ow satises the ow capacity constraint. Let ck (e) be the capacity of edge e in Gk . Clearly, 2ck
Com S 511: Homework #1
Due on Friday, September 4, 2009
1
Com S 511 : Homework #1
Problem 1
Problem 1
Because the network has no innite-capacity paths from s to t. So along each path from s to t, we could not send a nite among of ow, thus the maximum folw
Homework 1: Problems 4,5 and 6
Sudheer Vakati September 11, 2009
Problem 4 a) True All arc capacities are even. Divide all the arc capacities by 2. Find the maximum ow for the network. Mutiply the ow on each edge by 2. The resulting ow is a maximum ow for
Homework 2: Problems 3,4 and 6
Sudheer Vakati September 25, 2009
Problem 3 a)Formulate the problem as a circulation problem to nd the feasible ow f . The miminum required ow l on each edge translates to a demand on the nodes. Solving the circulation probl
Com S 511: Homework #3
Due on Friday, October 2, 2009
Yuheng Long
1
Yuheng Long
Com S 511 : Homework #3
Problem 1
Problem 1 Problem 2
We will have the following constraints: The aggregate ow on an edge e must be no more than the capacity of the edge, c(e)