Algorithm Design

By Harry Hakes

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 Internet age.

• Format: Hardcover
• Language: English
• ISBN: 0321295358
• ISBN13: 9780321295354
• Release Date: March 2005
• Publisher: Pearson
• Length: 864 Pages
• Weight: 3.47 lbs.
• Dimensions: 1.9" x 8.2" x 9.0"

Customer Reviews

Approachable

Algorithm Design is an approachable introduction to sophisticated computer science. It is the undergraduate CS textbook for Jon Kleinberg's introduction to algorithm design course, but I bought it for the mincut classification algorithm explanation in Chapter 7. While a useful reference for graph method algorithm design, I read most of the book from the beginning because the chapters nicely build upon themselves. I can't...

Awesome Book

Nicely written book. Easy to follow. The authors presented the algorithms very well. A minor complain would be that some of the proofs are too informal for my liking, and some proofs could be simpler. I would recommend this book to anyone who wants an introduction to the theory of computation. Another nice thing is the wide margin. This certainly encourages active learning.

Slightly better than Cormen - highly readable

Best undergraduate handbook about algorithms i've seen so far. Examples are much less artificial than in CLRS (Introduction to Algorithms). Most of them are highly practical, e.g. using Kruskal's MST algorithm as a simple clustering device. It's worth mentioning that E.Tardos is a world-class calibre specialist in graph algorithms. When you feel unsatisfied with network flows chapter, you can read her survey of network flows...

dealing with NP completeness

The text offers an interesting blend of rigour and informality. The numerous proofs in each chapter have that rigour. Yet what may be more important is how the text remains accessible to a primarily undergraduate audience. The book is not just a compendium of common algorithms in computer science, and proofs about them. The authors place a stronger emphasis on motivating how to develop an intuitive understanding of the problems...

Detailed, clear and complete

The flow in this book is excellent. The authors do a great job in organizing this book in logical chapter. The chapters are organized into techniques to find solutions to particular problems, like for example, Greedy Algorithms, Divide and Conquer, and Dynamic Programming. Each chapter contains a few representative problems of the technique or topic discussed. These are discussed in great detail, which is helpful to initially...