Catalog · Design and Analysis of Algorithms Lecture 18 of 34 Lecture 18: Complexity: Fixed-Parameter Algorithms ← Previous Lecture 17: Complexity: Approximation Algorithms Next → Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees ✓ Mark complete Materials Transcript (PDF) ↗ transcript