1. Introduction: Some Representative Problems
2. Basics of Algorithm Analysis
3. Graphs
4. Greedy Algorithms
5. Divide and Conquer
6. Dynamic Programming
7. Network Flow
8. NP and Computational Intractability
9. PSPACE: A Class of Problems beyond NP
10. Extending the Limits of Tractability
11. Approximation Algorithms
12. Local Search
13. Randomized Algorithms
Epilogue: Algorithms That Run Forever
References
Index