Paradigms for Fast Parallel Approximability: Cambridge International Series on Parallel Computation, cartea 8
Autor Josep Díaz, Maria Serna, Paul Spirakis, Jacobo Toránen Limba Engleză Paperback – 29 iul 2009
Preț: 261.54 lei
Preț vechi: 326.93 lei
-20% Nou
Puncte Express: 392
Preț estimativ în valută:
50.05€ • 51.99$ • 41.58£
50.05€ • 51.99$ • 41.58£
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
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.