Lecture Notes
Goldberg-Tarjan Min-Cost Circulation Algorithm
Description:
Lecture notes on the Goldberg-Tarjan min-cost circulation algorithm, Klein’s cycle cancelling algorithm for finding the circulation of minimum cost in greater detail, bounding the number of iterations, analysis for integer-valued costs, and strongly polynomial analysis.
Resource Type:
Lecture Notes
pdf
123 kB
Goldberg-Tarjan Min-Cost Circulation Algorithm
Course Info
Instructor
As Taught In
Fall
2008
Level
Learning Resource Types
notes
Lecture Notes
assignment_turned_in
Problem Sets with Solutions
