Cantitate/Preț
Produs

Paradigms for Fast Parallel Approximability: Cambridge International Series on Parallel Computation, cartea 8

Autor Josep Díaz, Maria Serna, Paul Spirakis, Jacobo Torán
en Limba Engleză Paperback – 29 iul 2009
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.
Citește tot Restrânge

Din seria Cambridge International Series on Parallel Computation

Preț: 26154 lei

Preț vechi: 32693 lei
-20% Nou

Puncte Express: 392

Preț estimativ în valută:
5005 5199$ 4158£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521117920
ISBN-10: 0521117925
Pagini: 168
Ilustrații: 32 b/w illus.
Dimensiuni: 170 x 244 x 9 mm
Greutate: 0.28 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge International Series on Parallel Computation

Locul publicării:Cambridge, United Kingdom

Cuprins

1. Introduction; 2. Basic concepts; 3. Extremal graph properties; 4. Rounding, interval partitioning and separation; 5. Primal-dual method; 6. Graph decomposition; 7. Further parallel approximations; 8. Non-approximability; 9. Syntactical defined phrases; Appendix: Definition of problems; Bibliography; Index.

Recenzii

Review of the hardback: 'Required reading for researchers working on parallel algorithms and of interest to anyone working in the area of parallel computing in general.' Brian Bramer, CVu

Descriere

A survey of the basic techniques for approximating combinatorial problems using parallel algorithms.