ConceptTheory & Algos
Christofides algorithm approximation
The algorithm achieves a -approximation for the metric Traveling Salesperson Problem by combining a minimum spanning tree and a minimum-weight perfect matching on odd-degree 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
4The lectures that define it or assume it, and the concepts next to it.