Paradigms for Fast Parallel Approximability

Paradigms for Fast Parallel Approximability

By (author) , By (author) , By (author) , By (author)


You save US$0.02

Free delivery worldwide

Dispatched from the UK in 3 business days

When will my order arrive?


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.

show more

Product details

  • Paperback | 168 pages
  • 170.18 x 241.3 x 10.16mm | 294.83g
  • Cambridge, United Kingdom
  • English
  • 32 b/w illus.
  • 0521117925
  • 9780521117920

Other books in Parallel Processing

Other people who viewed this bought

Other books in this series

Review quote

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

show more