Approximation Algorithms | 
 enlarge | Author: Vijay V. Vazirani
Publisher: Springer
Category: Book
List Price: $49.95
Buy New: $36.00
You Save: $13.95 (28%)
New (16) Used (5) from $36.00
Avg. Customer Rating:  6 reviews
Sales Rank: 269276
Media: Hardcover
Edition: Corrected
Number Of Items: 1
Pages: 256
Shipping Weight (lbs): 1.6
Dimensions (in): 9.4 x 6.3 x 1
ISBN: 3540653678
Dewey Decimal Number: 005.1
EAN: 9783540653677
ASIN: 3540653678
Publication Date: March 22, 2004
Availability: Usually ships in 1-2 business days
|
| 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.
|
| Customer Reviews: Read 1 more reviews...
 a wide variety of topics November 7, 2006
4 out of 6 found this review helpful
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. Also, it is not the sort of book that gives algorithm examples in an actual programming language. Not that this should be a handicap to a skilled reader. The algorithms are usually described in high level pseudocode. You have to manually instantiate these in the language of your preference.
The 30 chapters span a wide variety of computational topics. Some are simpler than others to understand. Like the chapter on finding the shortest vector from the integer lattice made from a set of linearly independent vectors. That requires only a year or so of introductory linear algebra.
There are exercises for each chapter. Some exercises are formidable. Essentially like little research problems in their own right. Another plus for the book.
Very nice introduction May 20, 2006
6 out of 6 found this review helpful
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.
Short and Sweet March 12, 2006
2 out of 3 found this review helpful
This is a fanastic topics book in approximation algorithms. The problems and proofs are challenging and concise, but written in a very accessible manner. It is a great reference book, and also a convenient place to grab a lecture from if you need something to fill our a course. I have found it extremely useful, and even fun to read. I highly reccomend it for any person interested in theoretical computer science.
Much needed desktop reference for anyone working with algorithms, networking protocols, optimization March 9, 2006
5 out of 5 found this review helpful
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.
Only for graduate level - very good November 22, 2005
3 out of 4 found this review helpful
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.
I think it is a very good book for a graduate student.
|
|
|
