Algorithm Design : Pearson New International Edition

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. 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 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. Cover......Page 1 Table of Contents......Page 4 Chapter 1. Introduction: Some Representative Problems......Page 6 Chapter 2. Basics of Algorithm Analysis......Page 34 Chapter 3. Graphs......Page 78 Chapter 5. Divide and Conquer......Page 120 Chapter 4. Greedy Algorithms......Page 162 Chapter 6. Dynamic Programming......Page 256 Chapter 7. Network Flow......Page 342 Chapter 8. NP and Computational Intractability......Page 456 Chapter 9. PSPACE: A Class of Problems beyond NP......Page 536 Chapter 10. Extending the Limits of Tractability......Page 558 Chapter 11. Approximation Algorithms......Page 604 Chapter 13. Randomized Algorithms......Page 666 Chapter 12. Local Search......Page 754 Epilogue: Algorithms That Run Forever......Page 800 References......Page 810 A......Page 820 C......Page 821 D......Page 822 I......Page 823 M......Page 824 P......Page 825 S......Page 826 V......Page 827 Z......Page 828