Buying Options
Print List Price: | $193.32 |
Kindle Price: | $74.99 Save $118.33 (61%) |
Sold by: | Pearson Education,Inc. Price set by seller. |
Your Memberships & Subscriptions
Algorithm Design 1st Edition, Kindle Edition
Price | New from | Used from |
This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book.
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.
- ISBN-13978-0321295354
- Edition1st
- PublisherPearson
- Publication dateFebruary 8, 2012
- LanguageEnglish
- File size12882 KB
Customers who viewed this item also viewed
Editorial Reviews
About the Author
Product details
- ASIN : B009TELNKO
- Publisher : Pearson; 1st edition (February 8, 2012)
- Publication date : February 8, 2012
- Language : English
- File size : 12882 KB
- Simultaneous device usage : Up to 2 simultaneous devices, per publisher limits
- Text-to-Speech : Not enabled
- Enhanced typesetting : Not Enabled
- X-Ray : Not Enabled
- Word Wise : Not Enabled
- Sticky notes : Not Enabled
- Print length : 864 pages
- Best Sellers Rank: #227,987 in Kindle Store (See Top 100 in Kindle Store)
- #27 in Algorithm Programming
- #57 in Programming Algorithms
- #713 in Programming Languages (Books)
- Customer Reviews:
About the author

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon
Reviewed in the United States on August 23, 2018
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
I initially thought that I had received a counterfeit copy of the book, but this was my introduction to "international edition" textbooks.
I bought a new, shrink-wrapped copy of this. The text of almost every page runs right into the binding, which makes it difficult to read. The printing on some pages is very crooked. A few pages seem to have been printed on dirty or slightly wrinkled paper. The second page of the book, "About the Authors," is glued for the first half inch to the page in front of it, covering up about the first four letters of each line of text. There is no copyright page. It is not on acid-free paper.
On the positive side, most pages are 100% readable if you jamb your fingers firmly into the binding to push the pages apart. So it may be a bargain if you don't mind doing that. Some of these imperfections are incidental in nature, and I don't know whether my copy is one of the better ones or one of the worse ones.
I have not yet read the book, so read other reviews and ratings for that aspect. It looks like a long, dense read, but well written. There are many diagrams and some code samples throughout.
I don't know if other editions have any color, but this one is only black-and-white. There does not appear to be anything needing color. Gray shading in the diagrams is perfectly legible.
Some sellers mention that this is the "international edition" but others don't. So I recommend checking the ISBN of whatever edition you consider and finding out where it was printed.
This book is wonderfully organized. I used it for an Algorithms course and it's just very well laid out, with a nice progression of topics. If you want to gain a good "overall" picture of algorithms, this book is perfect. As with any kind of math, if you want to go much deeper, you'll need specialized textbooks for particular topics, but for a reasonably complete, holistic, one-semester course, you'll love this book. I should also point out that there are several well-crafted exercises in each chapter to cement your understanding and give your grey matter a good workout!
IMPORTANT: The Kindle edition of this book is a horribly travesty to the non-digital edition. The typesetting is crude (Amazon, you can do way better!), important figures/diagrams are scaled to tiny sizes, and formulas just plain look incorrect. My best guess is that this was re-typeset by hand, by a non-technical person using MS Word, so they simply messed it up badly. Personally, I am kicking myself for having paid nearly $90 for this, when I could've bought the "real" textbook for $110.
I was sorely tempted to give it a one-star review, but the content is top-notch, brilliantly put-together and an asset to any student of Computer Science. To recap: DO NOT BUY THE KINDLE EDITION!
If you do buy the Kindle edition after reading this review, you'll only have yourself to blame.
Indian continent books are not supposed to be sold in US market but this seller (BestStore4Books) is doing it.
The biggest issue is that the authors assume a high degree of "obviousness" in problems. I don't mind having to make an intuitive leap to solve a problem, but this often requires an intuitive leap to understand the actual problem rather than the solution. For example, they do not often define terms used in questions, leaving the user to guess. Perhaps this should fall under the professor's domain, but it is still frustrating. The index is not great. The authors perhaps need to re-evaluate what is common knowledge to practitioners who are not invested in the domain of algorithm analysis.
Otherwise a good book. Heck, if you don't do the exercises and just use it for reference you couldn't do better.
Top reviews from other countries

(1) A motivation for each algorithm (the problem to be solved)
(2) A description of an algorithm that solves that problem
(3) An analysis of the algorithm (in terms of correctness and performance)
Many algorithms books (including the highly popular Cormen et al book) place most emphasis on (3).
This book, on the other hand, is strongest in (1), placing a lot of emphasis on describing challenging problems. This has the tremendous advantage of really getting you to see why you should even be interested in the algorithms themselves. For that alone, I recommend this book highly.
The only downside is that to make the book approachable, it deemphasises (3) which tends to be rather mathematical. If you are interested in analysis of algorithms, you need another book. If you can afford it, buying this book and the Cormen book would be ideal, since together they cover (1), (2), and (3) well.

CLRS is a very very dry book, it's boring and very difficult especially if you're studying the subject yourself. Don't get me wrong though, it's comprehensive, it's sufficiently rigorous and absolutely on the path to be a classic. It's dry but it's the best desert to visit.
I believe when you're starting a new topic, new subject you don't need how's and what's — you need why?
Algorithm design by Kleinberg and Tardos is exactly this — why algorithms? It reads very smooth, very clever and pauses enough to let you think and once you do it surprises you with insanely clever ways algorithms are designed and presents precise, clear formulations of the very best algorithms you should know.
Read it once with a pencil and again with paper and pen to note down important concepts. Read it again. The more you read further you'll realize that the concepts and problems before now can be approached in a more novel, efficient and clever ways still keeping the fundamental ethos of algorithm design true — simple yet efficient.
Every chapter has a few problems which to solve require you to feel how algorithms are designed — initially you'll be scared, frustrated and you might leave them unsolved. Don't worry and come back again and again till you solve your first one.
After this it's pure joy, pure bliss I never thought I would get from a book.
I do have CLRS. I like it but I love this book. Algorithm design easily & effortlessly catapults itself to my top academic texts I have ever read.
I'm eternally grateful for the Professors to write such a masterpiece.

It seems to be great and helpful, having good explanations, both textual and visual.
There's no reason I should give it less than 5 stars.
One addition would be nice though: to have answers for all exercises.
Now only some exercises have answers, thus making it harder to know if what I did was right.
Nevertheless, it's a great piece of work.

Cons :
Does not have a detailed index and preface compared to the digital version.
Although this does not happen often, but this delivery really was pretty bad. Had to contact support 4 times in 3 days. But, support staff did a pretty good job in sorting the thing out.
