Items related to Paradigms for Fast Parallel Approximability: 8 (Cambridge...
Paradigms for Fast Parallel Approximability: 8 (Cambridge International Series on Parallel Computation, Series Number 8) - Softcover
Synopsis
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.
"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 (Cambridge International Series on Parallel Computation, Series Number 8)
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2215580243832
Quantity: Over 20 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: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9780521117920
Quantity: 2 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, Mason, OH, 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521117920
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
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 4 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521117920
Quantity: 10 available
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
Quantity: 1 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: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521117920
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 4 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
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: AussieBookSeller, Truganina, VIC, Australia
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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521117920
Quantity: 1 available
Seller Image
Paradigms for Fast Parallel Approximability
Published by
Cambridge University Press, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 # 9780521117920
Quantity: 1 available