 |
|
|
Item Details
| Title:
|
PARADIGMS FOR FAST PARALLEL APPROXIMABILITY
|
| By: |
Josep Diaz, Maria Serna, Paul Spirakis |
| Format: |
Hardback |
| List price:
|
£68.00 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0521431700 |
| ISBN 13: |
9780521431705 |
| Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
| Pub. date: |
10 July, 1997 |
| Series: |
Cambridge International Series on Parallel Computation 8 |
| Pages: |
166 |
| Description: |
A survey of the basic techniques for approximating combinatorial problems using parallel algorithms. |
| 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. |
| Illustrations: |
32 b/w illus. |
| Publication: |
UK |
| Imprint: |
Cambridge University Press |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|