Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation)
 |
|
Описание:
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.Похожие книги
 | Encyclopedia of Social Problems (Two Volume Set) Автор: Vincent N. Parrillo Год: 2008 |
 | Learning to Solve Problems : An Instructional Design Guide (Tech Training Series) Автор: David H. Jonassen Год: 2003 |
 | Managing Time in Relational Databases: How to Design, Update and Query Temporal Data Автор: Tom Johnston, Randall Weis Год: 2010 |
 | Solitons and Inverse Scattering Transform Автор: Mark J. Ablowitz, Harvey Segur Год: 2000 |
| Solitons and Inverse Scattering Transform (SIAM Studies in Applied Mathematics, No. 4) Автор: Mark J. Ablowitz, Harvey Segur Год: 2000 |
 | Macs Portable Genius Автор: Paul McFedries Год: 2008 |