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.
1 Introduction: Some Representative Problems 2 Basics of Algorithms Analysis 3 Graphs 4 Greedy Algorithms 5 Divide and Conquer 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 Local Search 13 Randomized Algorithms Chapter 1. Introduction: Some Representative Propblems
Chapter 2. Basics of Algorithm Analysis
Chapter 3. Graphs
Chapter 4. Divide and Conquer
Chapter 5. Greedy Algorithms
Chapter 6. Dynamic Programming
Chapter 7. Network Flow
Chapter 8. NQ and Computational Intractability
Chapter 9. PSPACE: A Class of Problems beyond NP
Chapter 10. Extending the Limits of Tractability
Chapter 11 Approximation Algorithms
Chapter 12 Randomized Algorithms
Chapter 13. Local Search
Epilogue: Algorithms That Run Forever
References
Index