6.854J | Fall 2008 | Graduate

Advanced Algorithms

Study Materials

Lecture 12

Description:

Lecture notes on cancel and tighten algorithm for solving the mini- mum cost circulation problem, and splay trees, a data structure which will help reduce running time.

Course Info

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