ConceptTheory & Algos
Hardness of approximation
The computational complexity result showing that finding even an approximate solution to an NP-hard optimization problem within a certain factor is NP-hard.
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.
Approximation algorithm1NP-hardness1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
4The lectures that define it or assume it, and the concepts next to it.