HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
+ PRICE WATCH
* Amazon pricing is not included in price watch
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation) Book
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 s alesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. This will be a up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.Read More
from£N/A | RRP: * Excludes Voucher Code Discount Also available Used from £N/A
- 0521117925
- 9780521117920
- Josep Díaz, Maria Serna, Paul Spirakis, Jacobo Torán
- 30 July 2009
- Cambridge University Press
- Paperback (Book)
- 168
- 1
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.
Would you like your name to appear with the review?
We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.
All form fields are required.