Lecture Notes
Lecture 3
Description:
Lecture notes on maximum flows, the fattest path augmenting algorithm, an improvement over the Ford-Fulkerson algorithm, and the minimum cost circulation problem.
Resource Type:
Lecture Notes
pdf
213 kB
Lecture 3
Course Info
Instructor
As Taught In
Fall
2008
Level
Learning Resource Types
notes
Lecture Notes
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
