Homework

1. Homework #2 (Ford-Fulkerson counter example, vertex cover - matching duality)

2. Homework #3 (Dilworth, Koenig, Hall)

3. Homework #4 (Goldberg Tarjan: push relabel algorithm)

4. Homework #5 (Menger, Hoffman, transportation, Gabow (bit scaling))

5. Homework #6 (Applications of min cost flow)

6. Homework #7-part 1 and Homework #7-part 2 (Global min cuts)

7. Homework #8 on edge coloring - see lecture slides

8. Homework #9 - matching
9. Homework #10 -Linear programming (Caratheodory,Birkoff)
10. Homework #11 - duality