Visit our Christmas Gift Finder
Cambridge International Series on Parallel Computation: Paradigms for Fast Parallel Approximability Series Number 8 (Hardback)
  • Cambridge International Series on Parallel Computation: Paradigms for Fast Parallel Approximability Series Number 8 (Hardback)
zoom

Cambridge International Series on Parallel Computation: Paradigms for Fast Parallel Approximability Series Number 8 (Hardback)

(author), (author), (author), (author)
£67.00
Hardback 166 Pages / Published: 10/07/1997
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Cambridge University Press
ISBN: 9780521431705
Number of pages: 166
Weight: 450 g
Dimensions: 255 x 179 x 15 mm


MEDIA REVIEWS
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
"This monograph reads as smoothly as a single-author work. It can serve as an excellent reference for those interested in algorithmic and computational complexity results in parallel approximability. It can also serve as an excellent introduction to the field for theoretical researchers." Computing Reviews
"This is an excellent monograph that surveys one of the key parts of recent algorithm and complexity theory. This book really corresponds to its title Paradigms of fast parallel approximability. Because of this it is much more than a survey on the recent development in this area. I strongly recommend it as a valuable source for graduate courses in the subject also." Juraj Hromkovi^Dvc, Mathematical Reviews

You may also be interested in...

Practical Reverse Engineering
Added to basket
Computer Systems Architecture
Added to basket
The Soar Cognitive Architecture
Added to basket
Computer Systems Architecture
Added to basket
Professional CUDA C Programming
Added to basket
Articulating Design Decisions
Added to basket
The Art of Scalability
Added to basket
Beyond Software Architecture
Added to basket
Enterprise Data Architecture
Added to basket
Principles of Computer Hardware
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.