- Introduction to Linear Programming from the
perspective of Set Cover
- Introduction to network flow,
Ford-Fulkerson.
- Decomposition of standard flow in to flow paths (path packing).
- Review of flow augmenting algorithms,
matching and vertex cover in bipartite
graphs.
- Push-Relabel max flow algorithm: preliminaries.
- Push-Relabel max flow algorithm: generic
description and analysis.
- Push-Relabel max flow algorithm:
implementation in
- Max flow with lower
bounds
- Proof of Dilworth Theorem
- Minimum cycle mean algorithm
PPTX with narrations (zipped): Minimum cycle mean algorithm
- Min cost flow: definitions, Klein's
algorithm, Scaling algorithm
- Global min-cut algorithms in undirected
graphs
- Edge coloring (Vizing)
- Maximum matching algorithm in general
graphs
- Introduction to linear
programming
- Fourier Motzking elimination
- Farkas Lemma and Strong Duality