Study Materials
Lecture 11
Description:
Lecture notes on a strongly polynomial time algorithm, the Goldberg-Tarjan algorithm, the Cancel and Tighten algorithm, and a strongly polynomial bound.
pdf
756 kB
Lecture 11
Course Info
Instructor
As Taught In
Fall
2008
Level
Learning Resource Types
notes
Lecture Notes
assignment_turned_in
Problem Sets with Solutions
