Programming Books C Java PHP Python Learn more Browse Programming Books
Qty:1
  • List Price: $69.99
  • Save: $13.46 (19%)
Only 9 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Approximation Algorithms has been added to your Cart
FREE Shipping on orders over $35.
Condition: Used: Good
Comment: This is a used text in good condition. It may have some writing and highlighting. Ships directly from Amazon. Eligible for free super saver shipping.
Access codes and supplements are not guaranteed with used items.
Sell yours for a Gift Card
We'll buy it for $10.68
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Approximation Algorithms Hardcover – March 22, 2004

ISBN-13: 978-3540653677 ISBN-10: 3540653678

Buy New
Price: $56.53
40 New from $37.99 23 Used from $28.54
Amazon Price New from Used from
Hardcover
"Please retry"
$56.53
$37.99 $28.54
$56.53 FREE Shipping. Only 9 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

Approximation Algorithms + Randomized Algorithms + Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Price for all three: $196.22

Buy the selected items together

Customers Who Bought This Item Also Bought

NO_CONTENT_IN_FEATURE

Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Hardcover: 380 pages
  • Publisher: Springer (March 22, 2004)
  • Language: English
  • ISBN-10: 3540653678
  • ISBN-13: 978-3540653677
  • Product Dimensions: 9.2 x 0.9 x 6.1 inches
  • Shipping Weight: 1.6 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (9 customer reviews)
  • Amazon Best Sellers Rank: #521,487 in Books (See Top 100 in Books)

Editorial Reviews

Review

From the reviews:

"Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles." (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003)

"The book under review concentrates on the … design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. … The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. … Copious exercises are included to test and deepen the reader’s understanding. … It deserves a place in every computer science and mathematical library." (Mark R. Jerrum, Mathematical Reviews, 2002 h)

"The book of Vijay Vazirani is not the first one dedicated to approximation algorithms … . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms … . I suspect that for many researchers it would be the first one to consult … . It is a must acquisition for libraries of computer science/engineering departments … ." (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002)

"The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. … The book can be used for a graduate course on approximation algorithms. … The chapters also contain a section of exercises, which can help the students to understand the material in a deeper way. … On the other hand the book can be used by the researchers of the field … ." (Csanád Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)

From the Back Cover

 This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.

Richard Karp,University Professor, University of California at Berkeley

Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.

It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.

László Lovász, Senior Researcher, Microsoft Research


More About the Author

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

Customer Reviews

5.0 out of 5 stars
5 star
9
4 star
0
3 star
0
2 star
0
1 star
0
See all 9 customer reviews
Vazirani's book gives me a comprehensive (yet short) start.
Yi F
Very good, it is easy to read this book if you have a good level of knowledge and the experience to think some details in the proofs of the theorems.
konion
This is not only the best Appoximation Algorithm book out there, its one of the best books on graduate level mathematics I have ever seen.
Vivace

Most Helpful Customer Reviews

51 of 51 people found the following review helpful By Mosta McKracken on February 16, 2002
Format: Hardcover
I have been using Dorit Hochbaum's book on approximation algorithms for NP-Hard problems as a guideline for my work. Hochbaum's book is, without a doubt, terrific. However, the survey format compromised a smooth flow in favor of bringing together the best people in the field. This book (Vazirani's) corrects this by being so smooth and elegant from start to finish. Excellent problem sets, excellent hints for most problems, and there is a section at the end of the book devoted to open problems, which is a really really cool feature. My favorite chapter -29 I think- deals with hardness of approximation and the PCP theorem. The chapter explains the PCP theorem so vividly that the exact next thing I was doing was reading and comprehending the latest papers in this area. If you're a researcher in algorithms and complexity, then this book is highly recommended, especially at this ridiculously low price.
Note on my background: I am a graduate (masters) student in CS.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
7 of 7 people found the following review helpful By Ali Civril on May 19, 2006
Format: Hardcover
This is a quite nice book by an author who is well-known in the field. The book is not thematic, instead it presents certain problems in each chapter along with the main approximation algorithms and correctness proofs. Yet, each new concept is well introduced with the problems. For instance, the author presents LP-based techniques on the same problem (set cover) in the second part of the book. This makes it quite easy to compare and understand different techniques. The last part of the book is a little bit advanced compared to the first two parts which uses combinatorial or LP-based analysis of the algorithms. The presentation of the PCP theorem- arguably the deepest theorem of computer science- and its consequences are also in the last part.

A warning though: The book is quite terse at times, which enforces a dense reading. This may not be suitable for an undergradute study. My only complaint is that the PCP theorem might well be introduced with a little more intution.

Overall, I rate this book as excellent. If you are interested in algorithms, you should definitely buy it. Also, buy the "Complexity and Approximation" by Ausiello, Crescenzi and others. They provide a more comprehensive and thematic treatment. It also has an excellent bibliography and list of NP-hard problems. These two will make a great couple. The book edited by Hochbaum (Approximation Algorithms for NP-hard problems) on the other hand presents detailed information on the algorithms.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Hardcover
I have been looking for books related to solving NP-complete and NP-hard problems approximately. There is another book by Hochbaum and I have that too. Unfortunately, that book is more of a research oriented book as it is written by several researchers. It's like reading several research papers within two hard covers. This means that one needs to have a sort of intermediate level of experience with approximation algorithms.

For a beginner, one would expect a book that starts from ground-up and that has been written as a textbook rather than as a set of research papers. The book by Dr. Vazirani, is the only book that is written by one author with a step-by-step evolution of concepts and ideas related to approximation algorithms.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
3 of 3 people found the following review helpful By Vivace on December 8, 2011
Format: Hardcover
This is not only the best Appoximation Algorithm book out there, its one of the best books on graduate level mathematics I have ever seen. Such eloquent coverage of advanced topics. I can not recommend it highly enough.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
2 of 2 people found the following review helpful By Yi F on February 9, 2010
Format: Hardcover Verified Purchase
Let's be concrete.

The first part of the book presents a set of classical NP hard problems, set covering, bin packing, knapsack, etc. and their approximation algorithms. These algorithms are extracted from a number of fundamental papers, which are of long, delicate presentations. Vazirami presented the problems and solutions in a unified framework. The presentation appears much shorter than they were in the original papers, and they are concise, precise, explicit and comprehensive. For an algorithm researcher, if he read the book first and then those papers, he will be much more efficient than doing that other way (as I and many other people did.)

The second part of the book present the LP scheme of approximation algorithm design. I had little knowledge about this. But to pursue a career as an algorithm researcher, I must know this. Vazirani's book gives me a comprehensive (yet short) start.

I rarely give my reviews five stars (2% of my reviews get 5 stars so far), but this book deserves.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

What Other Items Do Customers Buy After Viewing This Item?