6.854J | Fall 2008 | Graduate

Advanced Algorithms

Lecture Notes

Lecture 3


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

Course Info

As Taught In
Fall 2008
Learning Resource Types
Lecture Notes
Problem Sets with Solutions