IEOR 6605, Fall 2001: Homework 04

Assigned: Friday, September 28, 2001
Due: Wednesday, October 3, 2001

General Instructions

  1. 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.
  2. Please do not express an algorithm using only pseudocode. Additional explanation is required!
  3. Numbered problems are all from the textbook Network Flows .

Problems

  1. Problem 6.12. Cuts and residual graphs.
  2. Problem 6.18. Minimum flow problem.
  3. Problem 6.34. Properties of max flows.
  4. Problem 6.38. Submodularity of cuts.
  5. Problem 6.48. Max flow with irrational capacities.

Switch to:

[email protected]