or
Sign in to turn on 1-Click ordering.
 
 
Express Checkout with PayPhrase
What's this? | Create PayPhrase
More Buying Choices
40 used & new from $28.96

Have one to sell? Sell yours here
 
   
Approximation Algorithms
 
See larger image
 

Approximation Algorithms (Hardcover)

~ (Author)
4.8 out of 5 stars  See all reviews (6 customer reviews)

List Price: $54.95
Price: $37.10 & this item ships for FREE with Super Saver Shipping. Details
You Save: $17.85 (32%)
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 Tuesday, November 17? Choose One-Day Shipping at checkout. Details
25 new from $32.16 15 used from $28.96

Formats

Amazon Price New from Used from
  Kindle Edition, March 22, 2004 $24.92 -- --
  Hardcover, March 21, 2004 $37.10 $32.16 $28.96

Frequently Bought Together

Approximation Algorithms + Combinatorial Optimization: Algorithms and Complexity + Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Price For All Three: $112.54

Show availability and shipping details


Customers Who Bought This Item Also Bought

Randomized Algorithms

Randomized Algorithms

by Prabhakar Raghavan
4.0 out of 5 stars (7)  $61.60
Algorithmic Game Theory

Algorithmic Game Theory

by Noam Nisan
4.0 out of 5 stars (2)  $33.75
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

by D. S. Johnson
4.8 out of 5 stars (13)  $61.87
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

by Michael Mitzenmacher
3.6 out of 5 stars (5)  $44.55
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach

by Sanjeev Arora
4.8 out of 5 stars (12)  $44.00
Explore similar items

Editorial Reviews

Product Description

Approximation algorithms are currently a central and fast-developing area of research in theoretical computer science. This monograph covers the basic techniques used in the latest research work, techniques that everyone in the field should know, and shows that they form the beginnings of a promising theory. The author consolidates progress made so far, including some very recent results, and makes a strong effort to convey the beauty and excitement of work in the field.

Product Details

  • Hardcover: 256 pages
  • Publisher: Springer; Corrected edition (March 22, 2004)
  • Language: English
  • ISBN-10: 3540653678
  • ISBN-13: 978-3540653677
  • Product Dimensions: 9.4 x 6.3 x 1 inches
  • Shipping Weight: 1.6 pounds (View shipping rates and policies)
  • Average Customer Review: 4.8 out of 5 stars  See all reviews (6 customer reviews)
  • Amazon.com Sales Rank: #58,223 in Books (See Bestsellers in Books)

    Popular in these categories: (What's this?)

    #4 in  Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Combinatorics
    #5 in  Books > Science > Mathematics > Pure Mathematics > Combinatorics
    #8 in  Books > Science > Mathematics > Pure Mathematics > Discrete Mathematics

More About the Author

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

Visit Amazon's Vijay V. Vazirani Page

What Do Customers Ultimately Buy After Viewing This Item?

Approximation Algorithms
75% buy the item featured on this page:
Approximation Algorithms 4.8 out of 5 stars (6)
$37.10
Combinatorial Optimization: Algorithms and Complexity
12% buy
Combinatorial Optimization: Algorithms and Complexity 4.6 out of 5 stars (18)
$13.57
Algorithmic Game Theory
5% buy
Algorithmic Game Theory 4.0 out of 5 stars (2)
$33.75
The Algorithm Design Manual
4% buy
The Algorithm Design Manual 4.5 out of 5 stars (34)
$61.15

Tags Customers Associate with This Product

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

Your tags: Add your first tag
 

 

Customer Reviews

6 Reviews
5 star:
 (5)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.8 out of 5 stars (6 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

 
47 of 47 people found the following review helpful:
5.0 out of 5 stars No approximations, this is THE optimal book!, February 16, 2002
By Mosta McKracken (Cambridge, MA USA) - See all my reviews
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 Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
6 of 6 people found the following review helpful:
5.0 out of 5 stars Very nice introduction, May 19, 2006
By Ali Civril (Troy, NY USA) - See all my reviews
(REAL NAME)   
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 Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
6 of 6 people found the following review helpful:
5.0 out of 5 stars Much needed desktop reference for anyone working with algorithms, networking protocols, optimization, March 8, 2006
By M. Kochhal "mk" (Detroit, MI, USA) - See all my reviews
(REAL NAME)   
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 Comment | Permalink | Was this review helpful to you? Yes No (Report this)


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

4.0 out of 5 stars a wide variety of topics
Vazirani's book seems well suited for a computer science researcher who has had a rigorous background in pure maths. The level of difficulty can be quite advanced. Read more
Published on November 6, 2006 by W Boudville

5.0 out of 5 stars Short and Sweet
This is a fanastic topics book in approximation algorithms. The problems and proofs are challenging and concise, but written in a very accessible manner. Read more
Published on March 12, 2006 by L. Celis

5.0 out of 5 stars Only for graduate level - very good
Very good, it is easy to read the book if you have a good level
of knowledge and the experience to think some details in the
proofs of the theorems. Read more
Published on November 22, 2005 by konion

Only search this product's reviews



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
Search all Amazon discussions
   



So You'd Like to...


Product Information from the Amapedia Community

Beta (What's this?)


Look for Similar Items by Category


Look for Similar Items by Subject

 

Feedback

If you need help or have a question for Customer Service, contact us.
 Would you like to update product info or give feedback on images?
Is there any other feedback you would like to provide?

Your comments can help make our site better for everyone.


Your Recent History

 (What's this?)

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.