6.854J | Fall 2005 | Graduate

Advanced Algorithms

Lecture Notes

mincostflow.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

As Taught In
Fall 2005
Level
Learning Resource Types
Problem Sets with Solutions