附註:Includes bibliographical references (pages 501-510) and index.
Pt. 1. Basic concepts and introduction to algorithms. ch. 1. Basic concepts in algorithmic analysis -- ch. 2. Mathematical preliminaries -- ch. 3. Data structures -- ch. 4. Heaps and the disjoint sets data structures -- pt. 2. Techniques based on recursion. ch. 5. Induction -- ch. 6. Divide and conquer -- ch. 7. Dynamic programming -- pt. 3. First-cut techniques. ch. 8. The greedy approach -- ch. 9. Graph traversal -- pt. 4. Complexity of problems. ch. 10. NP-complete problems -- ch. 11. Introduction to computational complexity -- ch. 12. Lower bounds -- pt. 5. Coping with hardness. ch. 13. Backtracking -- ch. 14. Randomized algorithms -- ch. 15. Approximation algorithms -- pt. 6. Iterative improvement for domain-specific problems. ch. 16. Network flow -- ch. 17. Matching -- pt. 7. Techniques in computational geometry. ch. 18. Geometric sweeping -- ch. 19. Voronoi diagrams.
摘要:Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions and the context appropriate for each of them. This book advocates the study of algorithm design techniques by presenting most of the useful algorithm design techniques and illustrating them through numerous examples.
