IEOR 6614, Spring 2011 : Homework 9

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. 10.2. Capacity scaling algorithm.
2. 10.22. Bit scaling of capacities.
3. 12.12. Dance Hall Problem.
4. 12.14. Doubly Stochastic Matrices.
5. 12.40. Maximal Matchings.
6. Suppose that you are given a bipartite graph with a (non-maximum) matching M. Let P be a maximal set of vertex-disjoint shortest augmenting paths with respoect to M. Give a linear time algorithm to compute P.

Switch to:

• Homework 8
• Homework 10