Paradigms for Fast Parallel Approximability

Klappentext A survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Zusammenfassung This 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. This is an up-to-date reference for graduate students and researchers in algorithmics. Inhaltsverzeichnis 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.

Product details

• Authors: Josep D¿, Josep Diaz, Josep (Universitat Politecnica De Catalunya Diaz, Josep Serna Diaz, Josep Díaz, Maria Serna, Serna Maria, Paul Spirakis, Spirakis Paul, Jacobo Torán
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 30.07.2009
• EAN: 9780521117920
• ISBN: 978-0-521-11792-0
• No. of pages: 168
• Series: Cambridge International Series; Cambridge International Series on Parallel Computation
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > Data communication, networks; COMPUTERS / Networking / General, COMPUTERS / Programming / Parallel, algorithms and data structures, Algorithms & data structures, Parallel processing, Grid and parallel computing