Paradigms for Fast Parallel Approximability
(Book #8 in the Cambridge International Series on Parallel Computation Series)
No Customer Reviews
Select Format
Select Condition 
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" x 6.7" x 9.6"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
