ConceptTheory & Algos
EPTAS
An efficient polynomial-time approximation scheme runs in time bounded by a function of 1 over epsilon multiplied by a polynomial in n.
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.
Polynomial-time approximation1PTAS1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.