Approximation Algorithms for Np-Hard Problems - Rilegato

 
9780534949686: Approximation Algorithms for Np-Hard Problems
Rilegato
ISBN 10: 0534949681 ISBN 13: 9780534949686
Casa editrice: Course Technology Ptr, 1996

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Product Description

Book by None

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Course Technology Ptr
Data di pubblicazione
1996
Lingua
Inglese
ISBN 10 
0534949681
ISBN 13 
9780534949686
Rilegatura
Copertina rigida
Numero di pagine
596
Redattore
Hochbaum Dorit
Contatto del produttore
non disponibile
Persona responsabile
non disponibile