ConceptMathematics
Dual of maximum matching LP
The dual problem to the maximum matching LP, which corresponds to the fractional vertex cover problem.
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.