Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation)

Díaz, Josep, Serna, Maria, Spirakis, Paul, Torán,

ISBN 10: 0521431700 / ISBN 13: 9780521431705

Published by Cambridge University Press, 1997

About this Item

Like New.

Seller Inventory # ERICA79005214317006

Bibliographic Details

• Title: Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation)
• Publisher: Cambridge University Press
• Publication Date: 1997
• Language: English
• ISBN 10: 0521431700
• ISBN 13: 9780521431705
• Binding: Hardcover
• Condition: Like New
• Book Type: book

About this title

Synopsis

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.

Review

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