ConceptTheory & Algos
Metric TSP approximation hardness
The inapproximability bound showing that it is NP-hard to approximate the metric Traveling Salesman Problem within a ratio of 111/110.
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.