IEOR 6605, Fall 2001: Homework 10

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 12.16. Arc coloring.
2. Problem 12.28. Stable Marriage.
3. Problem 12.32. Unstable roommates.
4. Problem 12.40. Maximal matchings.

   ---

   Switch to:

   • IEOR 6605, Fall 2001, Home Page
   • Homework 9
   • Homework 11

   ---

   cliff@ieor.columbia.edu