1. INTRODUCTION
2. ELEMENTARY DATA STRUCTURES
3. DIVIDE-AND-CONQUER
4. THE GREEDY METHOD
5. DYNAMIC PROGRAMMING
6. BASIC TRAVERSAL AND SEARCH TECHNIQUES
7. BACKTRACKING
8. BRANCH-AND-BOUND
9. ALGEBRAIC PROBLEMS
10. LOWER BOUND THEORY
11. NP-HARD AND NP-COMPLETE PROBLEMS
12. APPROXIMATION ALGORITHMS
13. PRAM ALGORITHMS
14. MESH ALGORITHMS
15. HYPERCUBE ALGORITHMS
INDEX
