Computers & Internet Books:

Paradigms for Fast Parallel Approximability

Sorry, this product is not currently available to order

Here are some other products you might consider...

Paradigms for Fast Parallel Approximability

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!
Unavailable
Sorry, this product is not currently available to order

Description

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.
Release date NZ
July 10th, 1997
Audience
  • Professional & Vocational
Illustrations
32 Line drawings, unspecified
Pages
166
Dimensions
179x255x15
ISBN-13
9780521431705
Product ID
2159735

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...