Paradigms for Fast Parallel Approximability : Cambridge International Series on Parallel Computation - Jacobo  Toran

Paradigms for Fast Parallel Approximability

By: Jacobo Toran, Paul Spirakis, Maria Serna, Josep Diaz

Paperback | 30 July 2009

At a Glance

Paperback


$71.95

or 4 interest-free payments of $17.99 with

 or 

Aims to ship in 7 to 10 business days

When will this arrive by?
Enter delivery postcode to estimate

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.
Industry Reviews
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

More in Algorithms & Data Structures

Code Dependent : Living in the Shadow of AI - Madhumita Murgia
The University and the Algorithmic Gaze - Lesley Gourlay

RRP $190.00

$157.95

17%
OFF
Algorithms in C, Part 5 : 3rd Edition - Graph Algorithms - Robert Sedgewick
Fundamentals of Python : Data Structures - Kenneth Lambert
Deep Learning Crash Course