Paradigms for Fast Parallel Approximability

— —

Josep Díaz (Universitat Politècnica de Catalunya, Barcelona) Maria Serna (Universitat Politècnica de Catalunya, Barcelona)

Paradigms for Fast Parallel Approximability

Josep Díaz (Universitat Politècnica de Catalunya, Barcelona), Maria Serna (Universitat Politècnica de Catalunya, Barcelona), Paul Spirakis (University of Patras, Greece) , Jacobo Torán (Universität Ulm, Germany)

$47.95

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Cambridge University Press
30 July 2009

Mathematics & Sciences; Grid & parallel computing; Algorithms & data structures; Parallel processing

Series: Cambridge International Series on Parallel Computation

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.

By: Josep Díaz (Universitat Politècnica de Catalunya Barcelona), Maria Serna (Universitat Politècnica de Catalunya, Barcelona), Paul Spirakis (University of Patras, Greece), Jacobo Torán (Universität Ulm, Germany)
Imprint: Cambridge University Press
Country of Publication: United Kingdom
Volume: No. 8
Dimensions: Height: 244mm, Width: 170mm, Spine: 9mm
Weight: 280g
ISBN: 9780521117920
ISBN 10: 0521117925
Series: Cambridge International Series on Parallel Computation
Pages: 168
Publication Date: 30 July 2009
Audience: Professional and scholarly , Undergraduate
Format: Paperback
Publisher's Status: Active

Reviews for Paradigms for Fast Parallel Approximability

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