Catalog · Design and Analysis of Algorithms Lecture 17 of 34 Lecture 17: Complexity: Approximation Algorithms ← Previous Lecture 16: Complexity: P, NP, NP-completeness, Reductions Next → Lecture 18: Complexity: Fixed-Parameter Algorithms ✓ Mark complete Materials Transcript (PDF) ↗ transcript