6.854J | Fall 2008 | Graduate

Advanced Algorithms

Lecture Notes

Lecture 5

Description:

Lecture notes on minimum cost circulation problem, the Goldberg-Tarjan algorithm, the Cancel-and-Tighten algorithm, splay trees, and dynamic trees.

Resource Type:
Lecture Notes

Course Info

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