What do you think?
Rate this book
Approximation Algorithms
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
380 pages, Hardcover
First published December 5, 2002
8 people are currently reading
234 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 2 of 2 reviews
Shelved as 'embarrassed-not-to-have-read'
March 20, 2009Amazon 2009-03-19. I was sparked to finally order this by Alan Fay adding it with five stars, and I'm certainly not going to allow myself to be outread by Alan Fay when it comes to theoretical computer science books written at my own Institute of Technology. Vazirani keeps the royalty statements for this book, courtesy of Cambridge Publishing, taped to the outside of his office -- he makes not cent one, in his own self-sacrificing protest against the price of scientific literature. I've said it once, and I'll say it again: Vazirani for President!
April 17, 2008
the best you can do for approximation algorithms. it's pretty readable and complete.
Displaying 1 - 2 of 2 reviews
Can't find what you're looking for?
Get help and learn more about the design.