Algorithm Design
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.\ August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the...
Search in google:
Intended for computer science students who have completed the CS1/CS2 sequence, this textbook introduces greedy algorithms, divide and conquer, dynamic programming, network flow, NP-complete problems, and three techniques for dealing with computationally intractable problems: identification of structured special cases, approximation algorithms, and local search heuristics. The authors are professors at Cornell University. Annotation ©2005 Book News, Inc., Portland, OR
1Introduction : some representative problems12Basics of algorithm analysis293Graphs734Greedy algorithms1155Divide and conquer2096Dynamic programming2517Network flow3378NP and computational intractability4519PSPACE : a class of problems beyond NP53110Extending the limits of tractability55311Approximation algorithms59912Local search66113Randomized algorithms707Epilogue : algorithms that run forever795
