| Paradigms for Fast Parallel Approximability Contributor(s): Díaz, Josep (Author), Serna, Maria (Author), Spirakis, Paul (Author) |
|
 |
ISBN: 0521431700 ISBN-13: 9780521431705 Publisher: Cambridge University Press OUR PRICE: $67.44 Product Type: Hardcover - Other Formats Published: August 1997 * Not available - Not in print at this time * |
| Additional Information |
| BISAC Categories: - Computers | Systems Architecture - Distributed Systems & Computing - Computers | Programming - General - Mathematics | Discrete Mathematics |
| Dewey: 511.602 |
| LCCN: 96051778 |
| Series: Cambridge International Parallel Computation |
| Physical Information: 0.6" H x 6.9" W x 9.8" (1.00 lbs) 166 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. |