Approximation Algorithms for NP-hard Problems

Approximation Algorithms for NP-hard Problems
ISBN-10
0534949681
ISBN-13
9780534949686
Category
Mathematics / Algebra / General
Pages
596
Language
English
Published
1997
Publisher
PWS Publishing Company
Author
Dorit S. Hochbaum

Description

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.

Similar books