Hot-m.com

By Jon Kleinberg, Éva Tardos

* Publisher: Addison Wesley
* Number Of Pages: 864
* Publication Date: 2005-03-26
* ISBN-10 / ASIN: 0321295358
* ISBN-13 / EAN: 9780321295354

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.

Summary: Good Condition and resaonable price
Rating: 5

The price of this book is reasonable,

and

I got this book in five days after ordering.

The condition of this book is as description.

Summary: Approachable
Rating: 5

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 promise you that you’ll be a great computer scientist if you master the topics in the book, but working through these examples and problems will make you better.

Summary: Very good
Rating: 5

Yes, this book was absolutely as expected. It came to me also bang on time. I am totally satisfied with this product. Not much to write about this, as it is a book and the book is great for any Computer Science student. It presents problems using daily life examples, and that helps a lot in understanding these algorithms.

Thanks.

Summary: Awesome Book
Rating: 5

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.

Summary: Succinctly presented
Rating: 4

One of the better algorithm books I have studied. The content is succinctly presented. It does a good job at handling some complex topics. I like the way the book focuses on techniques for designing algorithms. Manages to bring forth important concepts in algorithm design while keeping the book to a manageable size.

http://rapidshare.com/files/200219584/binder1.pdf