Book123

    Free register and download UseNet downloader, then you can FREE Download from UseNet.

    Download without Limit " Programming Approximation Algorithms for NP-Hard Problems " from UseNet for FREE!

More

Dorit Hochbaum, "Approximation Algorithms for NP-Hard Problems"

This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.

Summary: A good survey on approximation algorithms

Rating: 5

Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. This book is actually a collection of survey articles written by some of the foremost experts in this field.

Many of these developments are due to Mathemtical programming (primal dual, semidefinite programming et al). The most exciting of these has been the Goemans and Williamson algorithm for MAX CUT and MAX SAT. A good account of these techniques appears in Chapters 4 and 11.

On the other hand a sequence of unexpected results in complexity culminated in a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP. A good survey of "Hardness of Approximations" appears in Chapter 10, written by Sanjeev Arora and Carsten Lund both of whom were responsible for some original developments in this field.

I am going to purchase a copy of this book and can only strongly recommend it to everyone.

Buy Book at Lowest Price on Amazon

Not all books on / appear on the homepage.

In order not to miss many of them follow Download Link (Ebooks section) (see top of each page on AH)

and visit too :)

Rating:
2.5 out of 5 by Book123