ConceptTheory & Algos
Dual LP of max-st-flow
A minimization linear program over edge and vertex variables whose objective minimizes capacity weighted by lambda, subject to constraints relating lambda to vertex potentials mu.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.