6.854J | Fall 2008 | Graduate

Advanced Algorithms

Study Materials

Network flows


Lecture notes on network flows, the single source shortest path problem, the maximum flow problem, the minimum cost circulation problem, the maximum flow problem, bipartite matching, a circulation of minimum cost, Klein’s cycle canceling algorithm, the Goldberg-Tarjan algorithm, a faster cycle-canceling algorithm, and a strongly polynomial bound.

Course Info

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