AnyBook4Less.com
Find the Best Price on the Web
Order from a Major Online Bookstore
Developed by Fintix
Home  |  Store List  |  FAQ  |  Contact Us  |  
 
Ultimate Book Price Comparison Engine
Save Your Time And Money

Approximation Algorithms

Please fill out form in order to compare prices
Title: Approximation Algorithms
by Vijay V. Vazirani
ISBN: 3-540-65367-8
Publisher: Springer Verlag
Pub. Date: 09 August, 2001
Format: Hardcover
Volumes: 1
List Price(USD): $44.95
Your Country
Currency
Delivery
Include Used Books
Are you a club member of: Barnes and Noble
Books A Million Chapters.Indigo.ca

Average Customer Rating: 5 (1 review)

Customer Reviews

Rating: 5
Summary: No approximations, this is THE optimal book!
Comment: 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.

Similar Books:

Title: Randomized Algorithms
by Rajeev Motwani, Prabhakar Raghavan
ISBN: 0521474655
Publisher: Cambridge University Press
Pub. Date: 25 August, 1995
List Price(USD): $60.00
Title: Combinatorial Optimization : Algorithms and Complexity
by Christos H. Papadimitriou, Kenneth Steiglitz
ISBN: 0486402584
Publisher: Dover Pubns
Pub. Date: 07 July, 1998
List Price(USD): $19.95
Title: Combinatorial Optimization : Networks and Matroids
by Eugene Lawler
ISBN: 0486414531
Publisher: Dover Pubns
Pub. Date: 02 March, 2001
List Price(USD): $15.95
Title: Approximation Algorithms for NP-Hard Problems
by Dorit Hochbaum
ISBN: 0534949681
Publisher: Brooks Cole
Pub. Date: 26 July, 1996
List Price(USD): $67.95
Title: Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences)
by Michael R. Garey, David S. Johnson
ISBN: 0716710455
Publisher: W H Freeman & Co.
Pub. Date: June, 1979
List Price(USD): $41.26

Thank you for visiting www.AnyBook4Less.com and enjoy your savings!

Copyright� 2001-2021 Send your comments

Powered by Apache