Skip to content
ISBN: 0521117925
ISBN13: 9780521117920

Paradigms for Fast Parallel Approximability

(Book #8 in the Cambridge International Series on Parallel Computation Series)

$53.00List Price: $50.00
ISBN: 0521117925
ISBN13: 9780521117920
Formats

Conditions

A brand-new, unused copy in perfect condition.

Formats

Conditions

A brand-new, unused copy in perfect condition.

See all 2 editionsfrom $53.00

Book Overview

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, such as flows, coverings, matchings, traveling salesman problems, and graphs. For added clarity, 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 rounded off by an appendix that gives a convenient summary of the problems described in the book. This book is an up-to-date reference for research workers in the area of algorithms and for graduate courses in the subject.
Format:
Paperback
Language:
English
ISBN:
0521117925
ISBN13:
9780521117920
Release Date:
July 2009
Publisher:
Cambridge University Press
Length:
168 Pages
Weight:
0.61 lbs.
Dimensions:
0.4″ × 6.7″ × 9.6″
ComputersComputers & TechnologyMathMathematicsScience & Math

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.