6.854J | Fall 2005 | Graduate

Advanced Algorithms

Lecture Notes

min_cost_flow.pdf

Description:

This resource contains information on shortest augmenting paths: unit capacity networks, MCF scaling by capacity, and MCF scaling by cost.

Resource Type:
Lecture Notes

Course Info

Fall 2005
Problem Set Solutions
Problem Sets