COMPSCI 287
Approximation Algorithms
Most optimization problems arising in practice turn out to be NP-hard and therefore intractable. A pragmatic recourse is the design of polynomial time algorithms which find near-optimal solutions. This idea has led to a deep theory to address such problems.
Prerequisites & course information
Most optimization problems arising in practice turn out to be NP-hard and therefore intractable. A pragmatic recourse is the design of polynomial time algorithms which find near-optimal solutions. This idea has led to a deep theory to address such problems.
Sources
- Course catalogue ↗2026-2027