IEOR 6614, Spring 2007 : Homework 7

Assigned: Thursday, March 1, 2007
Due: Thursday, March 8, 2007

General Instructions

  1. Please review the course information.
  2. You must write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.
  3. Numbered problems are all from the textbook Network Flows .

Problems

  1. Problem 7.4. Example of push relabel algorithm.
  2. Problem 7.18. Note that the capacity scaling algorithm is slightly different, but related to the bit scaling algorithm and the maximum capacity path algorithm covered in class.
  3. Problem 7.12. Critical arcs.


Switch to:


cliff@ieor.columbia.edu