Identify TSP, knapsack, SAT as NP-complete, describe approximation algorithms.
This lesson requires an active subscription.