Algorithm Design and over 810,000 other books are available for Amazon Kindle � Amazon�s new wireless reading device. Learn more

Buy New

or
Sign in to turn on 1-Click ordering.
Buy Used
Used - Like New See details
$86.99 & this item ships for FREE with Super Saver Shipping. Details

or
Sign in to turn on 1-Click ordering.
 
   
Kindle Edition
 
   
More Buying Choices
Have one to sell? Sell yours here
or
Get a $37.75 Amazon.com Gift Card
Algorithm Design
 
See larger image
 
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.

Algorithm Design [Hardcover]

Jon Kleinberg (Author), �va Tardos (Author)

List Price: $125.00
Price: $103.03 & this item ships for FREE with Super Saver Shipping. Details
You Save: $21.97 (18%)
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Want it delivered Monday, February 14? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $87.94  
Hardcover $103.03  
Sell This Book Back for $37.75
Whether you buy it used on Amazon for $76.16 or somewhere else, you can sell it back to our Textbook Buyback Store at the current price of $37.75. Restrictions Apply
Used Price$76.16
Buyback Price$37.75
Price after
Buyback
$38.41
There is a newer edition of this item:
Algorithm Design Algorithm Design 4.3 out of 5 stars (21)
$104.59
Available for Pre-order

Special Offers and Product Promotions

  • Get $5 worth of eligible movies and TV shows from Amazon Video On Demand when you order $50 or more in textbooks. Here's how (restrictions apply)

Frequently Bought Together

Algorithm Design + Introduction to Algorithms, Third Edition + Computer Organization and Design, Fourth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)
Price For All Three: $229.06

Show availability and shipping details

Buy the selected items together

Customers Who Bought This Item Also Bought


Editorial Reviews

Product Description

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches 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.


Product Details


More About the Author

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

Visit Amazon's Jon Kleinberg Page

 

Customer Reviews

21 Reviews
5 star:
 (12)
4 star:
 (5)
3 star:
 (3)
2 star:    (0)
1 star:
 (1)
 
 
 
 
 
Average Customer Review
4.3 out of 5 stars (21 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Create your own review
Most Helpful Customer Reviews

44 of 46 people found the following review helpful:
5.0 out of 5 stars Detailed, clear and complete, July 18, 2005
By 
This review is from: Algorithm Design (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.


29 of 34 people found the following review helpful:
5.0 out of 5 stars dealing with NP completeness, July 30, 2005
This review is from: Algorithm Design (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.)


14 of 15 people found the following review helpful:
5.0 out of 5 stars Slightly better than Cormen - highly readable, June 11, 2007
Amazon Verified Purchase(What's this?)
This review is from: Algorithm Design (Hardcover)
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.

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews

4.0 out of 5 stars A great introductory text to algorithms
I loved this book because it provided a great and simple introduction to algorithms. The text was well-written and extremely easy to follow.
Published 3 months ago by BlueBlur

4.0 out of 5 stars Great
This product came in great time. The only issue with the book is some sticky substance left from a removed sticker
Published 4 months ago by bw

5.0 out of 5 stars I love it!
This book reminds me of everything I love about algorithms. It is well-written, with just the right amount of mathematical rigor.
Published 5 months ago by Samir Bajaj

5.0 out of 5 stars Excellent book
Excellent read, the book does a superb job of explaining how many different concepts work, and in a way easy for most people to understand.
Published 10 months ago by Chris

3.0 out of 5 stars Decent; Probably Better for Beginners
This textbook is meant to follow the curriculum of a Data Structures and Algorithms course. It is by no means a stand-alone reference, and pales in comparison to such textbooks...
Published 11 months ago by Steven J. Tricanowicz

1.0 out of 5 stars Kindle edition is defective
Well, the content of the book is great: I will give 4 stars to it. But the kindle edition I bought is annoying in that it does not display a lot of symbols correctly.
Published 15 months ago by Disappointed Customer

5.0 out of 5 stars Good Condition and resaonable price
The price of this book is reasonable,

and

I got this book in five days after ordering.
Published on February 8, 2009 by Yu-jen Huang

5.0 out of 5 stars 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...
Published on December 12, 2008 by S. Purpura

5.0 out of 5 stars Very good
Yes, this book was absolutely as expected. It came to me also bang on time. I am totally satisfied with this product.
Published on October 28, 2008 by S. Surender

5.0 out of 5 stars 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...
Published on July 26, 2008 by Prof Wollongong

Only search this product's reviews



What Do Customers Ultimately Buy After Viewing This Item?

Algorithm Design
85% buy the item featured on this page:
Algorithm Design 4.3 out of 5 stars (21)
$103.03
Introduction to Algorithms, Third Edition
9% buy
Introduction to Algorithms, Third Edition 4.4 out of 5 stars (21)
$58.00
Cracking the Coding Interview, Fourth Edition: 150 Programming Interview Questions and Solutions
2% buy
Cracking the Coding Interview, Fourth Edition: 150 Programming Interview Questions and Solutions 4.7 out of 5 stars (19)
$31.58
Computer Organization and Design, Fourth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)
2% buy
Computer Organization and Design, Fourth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design) 4.1 out of 5 stars (21)
$68.03

Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Only search this product's forum
   





Look for Similar Items by Category


Look for Similar Items by Subject