9780534949686
Approximation Algorithms For NP-Hard Problems - Dorit S. Hochbaum
PWS Pub. Co. (1997)
In Collection
#4847

Read It:
Yes
Algorithms, Approximation theory, Programming (Mathematics)

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.

Product Details
LoC Classification T57.7 .A68 1997
Dewey 511.42
Format Hardcover
Cover Price 79,95 €
No. of Pages 632
Height x Width 240 x 169 mm
Personal Details
Links Library of Congress