Algorithm Design

Description

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Key Features

• Focus on problem analysis and design techniques.
• Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text.
• Over 200 well crafted problems from companies such as Yahoo!® and Oracle®. Each problem has been class tested for usefulness and accuracy in the authors’ own undergraduate algorithms courses.
• Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms.

Table of Contents

1. Introduction: Some Representative Problems
2. Basics of Algorithms Analysis
3. Graphs
4. Divide and Conquer
5. Greedy Algorithms
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. Randomized Algorithms
13. Local Search