ConceptTheory & Algos
2-Approximation algorithm for vertex cover
An algorithm that guarantees finding a vertex cover whose size is at most twice the size of the optimal vertex cover.
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.