- Homework #2
(Ford-Fulkerson
counter example, vertex cover - matching duality)
- Homework #3
(Dilworth, Koenig,
Hall)
- Homework #4
(Goldberg Tarjan:
push relabel algorithm)
- Homework #5
(Menger, Hoffman,
transportation, Gabow (bit scaling))
- Homework #6
(Applications of min cost flow)
- Homework #7-part 1
and
Homework #7-part 2
(Global min cuts)
- Homework #8 on edge coloring - see lecture slides
- Homework #9 - matching
- Homework #10 -Linear programming (Caratheodory,Birkoff)
- Homework #11 - duality

2010-01-31