Paradigms for Fast Parallel Approximability (Paperback)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge International Series on Parallel Computation
Release date:	July 2009
First published:	April 2009
Authors:	Josep Diaz • Maria Serna • Paul Spirakis • Jacobo Toran
Dimensions:	244 x 170 x 9mm (L x W x T)
Format:	Paperback - Trade
Pages:	168
ISBN-13:	978-0-521-11792-0
Categories:	Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing Promotions
LSN:	0-521-11792-5
Barcode:	9780521117920

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!