zbMATH — the first resource for mathematics

Approximation algorithms for NP-hard problems. (English) Zbl 1368.68010
Boston, MA: PWS Publishing (ISBN 0-534-94968-1). xxii, 596 p. (1996).
Publisher’s 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. The book 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.
The articles of this volume will not be indexed individually.

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
90-06 Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25 Approximation algorithms
90C59 Approximation methods and heuristics in mathematical programming
00B15 Collections of articles of miscellaneous specific interest