Learning objectives
After this class, you should be able to:
- Develop greedy approximation algorithms, derive bounds on the optimal solution, give examples to show that these bounds are tight, and derive approximation factors.
Reading assignment
- Chapter 2, up to (and including) section 2.1. Page 68.
Exercises and review questions
- Questions on current lecture's material
- Problem 2.3.
- Problem 2.6, part 1.
- Questions on next lecture's material
- Give an example of the Knapsack problem.