Approximation Algorithms for NP-Hard Problems

by Dorit Hochbaum (Editor)

ISBN 10: 0534949681 / ISBN 13: 9780534949686

Verlag: Course Technology, 1996

Beschreibung

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

Bestandsnummer des Verkäufers 117B2-133A11-BX216-20-05349496-HC-2P2-lb

Bibliografische Details

• Titel: Approximation Algorithms for NP-Hard Problems
• Verlag: Course Technology
• Erscheinungsjahr: 1996
• Sprache: Englisch
• ISBN-10: 0534949681
• ISBN-13: 9780534949686
• Einband: Hardcover
• Auflage: 1st Edition
• Zustand: New

Über diesen Titel

Inhaltsangabe

Discussing approximation algorithms for n-p hard problems, this study details scheduling, connectivity problems, randomization in approximations, best possible results, and on-line and server problems.

Reseña del editor

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.