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.
The full text downloaded to your computer
With eBooks you can:
- search for key concepts, words and phrases
- make highlights and notes as you study
- share your notes with friends
eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps.
Upon purchase, you'll gain instant access to this eBook.
Time limit
The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.
All prices
More details
Other editions
Additional editions
Content
- 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
- Epilogue: Algorithms that Run Forever
- References
- Index
