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 ...
Read More
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.
Read Less
Add this copy of Paradigms for Fast Parallel Approximability to cart. $42.88, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2009 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Contains: Line drawings. Cambridge International Series on Parallel Computation . 32 b/w illus. Intended for professional and scholarly audience.
Add this copy of Paradigms for Fast Parallel Approximability to cart. $45.77, new condition, Sold by Ria Christie Books rated 5.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2009 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). 168 p. Cambridge International Series on Parallel Computation . 32 Line drawings, unspecified. Intended for professional and scholarly audience.
Add this copy of Paradigms for Fast Parallel Approximability to cart. $48.17, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2009 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Contains: Line drawings. Cambridge International Series on Parallel Computation . 32 b/w illus. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Paradigms for Fast Parallel Approximability (Cambridge to cart. $68.89, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Hialeah, FL, UNITED STATES, published 2009 by Cambridge University Press.
Add this copy of Paradigms for Fast Parallel Approximability (Cambridge to cart. $8.00, like new condition, Sold by Powell's Books Chicago rated 5.0 out of 5 stars, ships from Chicago, IL, UNITED STATES, published 1997 by Cambridge University Press.
Add this copy of Paradigms for Fast Parallel Approximability (Cambridge to cart. $35.72, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Hialeah, FL, UNITED STATES, published 1997 by Cambridge University Press.
