Approximation Algorithms for NP-Hard Problems

by Dorit Hochbaum (Editor)

ISBN 10: 0534949681 / ISBN 13: 9780534949686

Editore: Course Technology, 1996

Riguardo questo articolo

SHRINK-WRAPPED NEW : US SELLER SHIPS FROM USA TO LOCATIONS WITHIN USA.

Codice articolo 117B2-133A11-BX216-20-05349496-HC-2P2-lb

Dati bibliografici

• Titolo: Approximation Algorithms for NP-Hard Problems
• Editore: Course Technology
• Data di pubblicazione: 1996
• Lingua: Inglese
• ISBN 10: 0534949681
• ISBN 13: 9780534949686
• Rilegatura: Hardcover
• Edizione: 1st Edition
• Condizione: New

Descrizione articolo

Riassunto

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 Description

Book by None