ConceptTheory & Algos
Perfect matching cost bound
The cost of a minimum weight perfect matching on the set of odd vertices is bounded by half the cost of the optimal Hamiltonian cycle on those vertices.
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.