Paradigms for Fast Parallel Approximability

Josep Diaz

ISBN 10: 0521117925 / ISBN 13: 9780521117920

Editore: Cambridge University Press, 2009

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.

Codice articolo 9780521117920

Dati bibliografici

• Titolo: Paradigms for Fast Parallel Approximability
• Editore: Cambridge University Press
• Data di pubblicazione: 2009
• Lingua: Inglese
• ISBN 10: 0521117925
• ISBN 13: 9780521117920
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 244 L x 170 A x 9 P (millimetri) 244 millimetri di larghezza per 170 millimetri di altezza per 9 millimetri di profondità
• Peso: 302 grammi

Descrizione articolo

Riassunto

A survey of the basic techniques for approximating combinatorial problems using parallel algorithms.

Recensione

Review of the hardback: 'Required reading for researchers working on parallel algorithms and of interest to anyone working in the area of parallel computing in general.' Brian Bramer, CVu