Algorithm Design and over one million other books are available for Amazon Kindle. Learn more



or
Sign in to turn on 1-Click ordering
Sell Us Your Item
For a $64.00 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Start reading Algorithm Design on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.
Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 

Algorithm Design [Hardcover]

Jon Kleinberg , Éva Tardos
4.1 out of 5 stars  See all reviews (36 customer reviews)

Buy New
$117.35 & FREE Shipping. Details
Rent
$40.17 & this item ships for FREE with Super Saver Shipping. Details
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
In Stock.
Want it tomorrow, May 21? Choose One-Day Shipping at checkout. Details
Free Two-Day Shipping for College Students with Amazon Student

Formats

Amazon Price New from Used from
Kindle Edition $87.94  
Hardcover $117.35  
Paperback --  
Unknown Binding --  
Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now
There is a newer edition of this item:
Algorithm Design Algorithm Design
$47.52
Available for Pre-order

Book Description

March 26, 2005 0321295358 978-0321295354 1
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.




Frequently Bought Together

Algorithm Design + Introduction to Algorithms + Cracking the Coding Interview: 150 Programming Questions and Solutions
Price for all three: $221.28

Buy the selected items together


Product Details

  • Hardcover: 864 pages
  • Publisher: Addison-Wesley; 1 edition (March 26, 2005)
  • Language: English
  • ISBN-10: 0321295358
  • ISBN-13: 978-0321295354
  • Product Dimensions: 8.3 x 1.3 x 9.4 inches
  • Shipping Weight: 3.5 pounds (View shipping rates and policies)
  • Average Customer Review: 4.1 out of 5 stars  See all reviews (36 customer reviews)
  • Amazon Best Sellers Rank: #169,212 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews
54 of 57 people found the following review helpful
5.0 out of 5 stars Detailed, clear and complete July 18, 2005
Format:Hardcover
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 grasp the concepts. Furthermore, the end of each chapter contains a number of solved exercises. These are written up in less detail than the chapter problems, because they are usually slight variations or applications of the representative problems. I found these to be very helpful to me, as to build up a stronger grasp of the problem at hand.

Furthemore, the progressive search for a solution, such as for the Weighted Interval Scheduling problem using dynamic programming, is essential to understanding the process through which we can find such algorithms. The book is well written, in a clear, understandable language. The supplementary chapters on Basics of Algorithm Analysis and Graph Theory are a great started for people who have not been exposed to those concepts previously.

Network flows are covered extensively with their applications. I suppose this section of the course was enhanced because our instructor's research interests are Network Flows and she threw example after example at us. There are a great number of problems at the end of this chapter to practice.

(...)
One of the strenghs of this book, is that when the authors determine the running time of a particular algorithm, they write about how to implement it, with which data structures and why. Although it is assumed that data structures are common knowledge for the reader, this type of analysis is helpful for further understanding of such structures.

All in all, this is a great textbook for an introductory course in the design of algorithms.
Comment | 
Was this review helpful to you?
25 of 26 people found the following review helpful
5.0 out of 5 stars Slightly better than Cormen - highly readable June 11, 2007
Format:Hardcover|Amazon Verified Purchase
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 (written with two other graph titans - Goldberg and Tarjan)
The division into chapters is good, yet classical. There are also exercises after each chapter, lots of them, good for preparation if you have algorithm-oriented job interview (Google, Yahoo, Microsoft etc.).

What's next? Read Tarjan's evergreen classic - Data Structures and Network Algorithms.
Comment | 
Was this review helpful to you?
34 of 39 people found the following review helpful
5.0 out of 5 stars dealing with NP completeness July 30, 2005
Format:Hardcover
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 that the algorithms address, and of how to shape new algorithms. Or, possibly, apply or modify existing algorithms to new problems.

If you compare the text to Knuth's classic "Art of Computer Programming", then you might find Kleinberg and Tardos more accessible. (At least for undergraduate readership.)

Also, the extensive exercises at the end of each chapter often have contexts germane to the Web. For example, the links in web pages are used to motivate problems in graph theory, where we have directed (unidirectional) graphs, due to the one way nature of links. More generally, the recent, contextual nature of the problems may appeal to some students. Knuth had many exercises listed in his books, but they can be too abstract for most students.

The text also has an interesting chapter on NP problems. The authors address a very practical situation. Even if you find that you have a problem that is NP complete, it is not necessarily the end of the story. For real life reasons, you may have to find an approximate solution that is computationally feasible to evaluate. The chapter offers suggestions and examples that may be of help. (More formal texts might merely stop at proving NP completeness.)
Comment | 
Was this review helpful to you?
Most Recent Customer Reviews
5.0 out of 5 stars Very clear with excellent examples.
The book is very good and has great examples to explain all of the difficult concepts. This book is used at universities such as Cornell and Princeton.
Published 6 days ago by tesh
2.0 out of 5 stars "Pretty much" doesn't cover anything fully
This book covers the entire array of topics one could hope to cover with any algorithms book, but the explanations and execution of proofs is severely lacking. Read more
Published 12 days ago by Casey
5.0 out of 5 stars Used for class and really liked
This book covers all major algorithms and is well written. I frequently read the book to understand what the professor couldn't explain well. Read more
Published 18 days ago by T. Lyon
5.0 out of 5 stars Concepts are explained in a very nice manner
The best thing i like about this book is the way they explain the concepts. Most algorithm books would say this is the problem, and this is how you solve it. Read more
Published 1 month ago by abhishekprateek
5.0 out of 5 stars Nice book
This book gives detailed explanations and solutions on popular and basic algorithm. After solving these problems on book, the basic knowledge of algorithm is supposed to master.
Published 1 month ago by Wei S
5.0 out of 5 stars its a great book!!!
its a good book with lots of information in it regarding the respective subject.
thank you so much for the book.
Published 1 month ago by venkat reddy
1.0 out of 5 stars Completely abstract book. Very hard to follow text.
I had to buy this book as it was prescribed as the textbook for a course that I am taking. Every time I tried to read through it I only got lost after a page or so. Read more
Published 2 months ago by Rigorist
5.0 out of 5 stars Very insightful and helpful.
This is a great book on algorithms. It covers all the basics plus more in depth analysis than other algorithms books. Read more
Published 2 months ago by Highlanderkev
5.0 out of 5 stars Very well written, easily readable
This is a very well written book on Algorithms design. The flow of chapters is a little different from some of the traditional algorithm texts, but is quite intuitive and nice. Read more
Published 2 months ago by Amshuman
1.0 out of 5 stars typesetting errors
Avoid the kindle version at all costs. I bought it for a class. Chapter 13 is full of missing formulas blank spaces ( at least as viewed with 'read.amazon. Read more
Published 6 months ago by Matthew G. Newcomb
Search Customer Reviews
Only search this product's reviews

What Other Items Do Customers Buy After Viewing This Item?


Forums

There are no discussions about this product yet.
Be the first to discuss this product with the community.
Start a new discussion
Topic:
First post:
Prompts for sign-in
 



So You'd Like to...


Create a guide


Look for Similar Items by Category