Sign inSign in

Christofides algorithm approximation

The algorithm achieves a 32\frac{3}{2}-approximation for the metric Traveling Salesperson Problem by combining a minimum spanning tree and a minimum-weight perfect matching on odd-degree vertices.
Watch it explained

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

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.