| Paradigms for Fast Parallel Approximability Contributor(s): Díaz, Josep (Author), Serna, Maria (Author), Spirakis, Paul (Author) |
|
 |
ISBN: 0521117925 ISBN-13: 9780521117920 Publisher: Cambridge University Press OUR PRICE: $44.64 Product Type: Paperback - Other Formats Published: July 2009 Annotation: A survey of the basic techniques for approximating combinatorial problems using parallel algorithms. |
| Additional Information |
| BISAC Categories: - Computers | Networking - General - Mathematics |
| Dewey: 511.602 |
| Series: Cambridge International Series on Parallel Computation |
| Physical Information: 0.36" H x 6.69" W x 9.61" (0.61 lbs) 168 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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, such as flows, coverings, matchings, traveling salesman problems, and graphs. For added clarity, 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 rounded off by an appendix that gives a convenient summary of the problems described in the book. This book is an up-to-date reference for research workers in the area of algorithms and for graduate courses in the subject. |