Paradigms for Fast Parallel Approximability: 8 (Cambridge International Series on Parallel Computation, Series Number 8) - Softcover
Synopsis
A survey of the basic techniques for approximating combinatorial problems using parallel algorithms.
"synopsis" may belong to another edition of this title.
Review
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
Book Description
This 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. This is an up-to-date reference for graduate students and researchers in algorithmics.
"About this title" may belong to another edition of this title.
Search results for Paradigms for Fast Parallel Approximability: 8 (Cambridge...
Stock Image
Paradigms for Fast Parallel Approximability
Published by
Cambridge University Press, GB, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. 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. Seller Inventory # LU-9780521117920
Buy New
£ 47.63
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Paradigms for Fast Parallel Approximability (Paperback)
Published by
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. This 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. This is an up-to-date reference for graduate students and researchers in algorithmics. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521117920
Stock Image
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9780521117920
Stock Image
Paradigms for Fast Parallel Approximability
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 1st edition. 166 pages. 9.50x6.70x0.40 inches. In Stock. This item is printed on demand. Seller Inventory # __0521117925
Buy New
£ 43.57
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Softcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521117920_new
Buy New
£ 43.33
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation)
Published by
Cambridge University Press 2009-06-16, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521117920
Buy New
£ 40.41
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Stock Image
Paradigms for Fast Parallel Approximability: 8 (Cambridge International Series on Parallel Computation, Series Number 8)
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Softcover
First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. A survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Series: Cambridge International Series on Parallel Computation. Num Pages: 168 pages, 32 b/w illus. BIC Classification: UKG; UMB; UYFP. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 9. Weight in Grams: 280. . 2009. 1st Edition. paperback. . . . . Seller Inventory # V9780521117920
Buy New
£ 52.03
£ 9.10 shipping
Ships from Ireland to U.S.A.
Ships from Ireland to U.S.A.
Quantity: Over 20 available
Stock Image
Paradigms for Fast Parallel Approximability: 8 (Cambridge International Series on Parallel Computation, Series Number 8)
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. A survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Series: Cambridge International Series on Parallel Computation. Num Pages: 168 pages, 32 b/w illus. BIC Classification: UKG; UMB; UYFP. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 9. Weight in Grams: 280. . 2009. 1st Edition. paperback. . . . . Books ship from the US and Ireland. Seller Inventory # V9780521117920
Stock Image
Paradigms for Fast Parallel Approximability (Paperback)
Published by
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. This 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. This is an up-to-date reference for graduate students and researchers in algorithmics. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521117920
Buy New
£ 47.99
£ 37 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Paradigms for Fast Parallel Approximability
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This 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. This is an up-to-date refer. Seller Inventory # 446926519
Buy New
£ 50.08
£ 42.45 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available