Content

1. Introduction
2. The Divide and Conquer Approach
3. Graph algorithms
4. The Greedy Approach
5. The Dynamic Programming Approach
6. Lower bound arguments, complexity classes P, NP and NP-complete