Approximation Algorithms For Np-Hard Problems - Hardcover

Hochbaum, Dorit-S

Hardcover

ISBN 10: 0534949681 ISBN 13: 9780534949686

Verlag: Wadsworth / Brooks/cole, 1996

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.

Über diesen Titel

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.

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.

Details zur Ausgabe

• Verlag: Wadsworth / Brooks/cole
• Erscheinungsdatum: 1996
• Sprache: Englisch
• ISBN 10: 0534949681
• ISBN 13: 9780534949686
• Einband: Tapa dura
• Anzahl der Seiten: 464
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Nicht verfügbar