Approximation Algorithms For Np-Hard Problems - Tapa dura

Hochbaum, Dorit-S

 
9780534949686: Approximation Algorithms For Np-Hard Problems
Tapa dura
ISBN 10: 0534949681 ISBN 13: 9780534949686
Editorial: Wadsworth / Brooks/cole, 1996

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Wadsworth / Brooks/cole
Año de publicación
1996
Idioma
Inglés
ISBN 10 
0534949681
ISBN 13 
9780534949686
Encuadernación
Tapa dura
Número de páginas
464
Contacto del fabricante
no disponible
Persona responsable
no disponible