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.
ASIN: 0534949681
VSKU: LFV.0534949681.VG
Condition: Very Good
Author/Artist:Dorit Hochbaum
Binding: Hardcover
Note: Any images shown are stock photographs and product may differ from what is shown.
Condition Notes: Book is in very good condition. Clean with little to no signs of wear or markings highlights.