Articles liés à Paradigms for Fast Parallel Approximability
Synopsis
A survey of the basic techniques for approximating combinatorial problems using parallel algorithms.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Revue de presse
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
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 51,66
EUR 4,59 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisRésultats de recherche pour Paradigms for Fast Parallel Approximability
Image d'archives
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Edité par
Cambridge University Press, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521117920_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation)
Edité par
Cambridge University Press 2009-06-16, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Paperback
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9780521117920
Quantité disponible : 10 disponible(s)
Image d'archives
Paradigms for Fast Parallel Approximability
impression à la demandeVendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 1st edition. 166 pages. 9.50x6.70x0.40 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521117925
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Paradigms for Fast Parallel Approximability
Edité par
Cambridge University Press, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 446926519
Quantité disponible : Plus de 20 disponibles
Image d'archives
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Edité par
Cambridge University Press, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Couverture souple
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9780521117920
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Paradigms for Fast Parallel Approximability
Edité par
Cambridge University Press, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9780521117920
Quantité disponible : 1 disponible(s)
Image d'archives
Paradigms for Fast Parallel Approximability (Paperback)
Edité par
Cambridge University Press, Cambridge, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Paperback
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9780521117920
Quantité disponible : 1 disponible(s)
Image d'archives
Paradigms for Fast Parallel Approximability (Paperback)
Edité par
Cambridge University Press, Cambridge, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Paperback
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9780521117920
Quantité disponible : 1 disponible(s)
Image d'archives
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Edité par
Cambridge University Press, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Neuf
Couverture souple
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580243832
Quantité disponible : Plus de 20 disponibles
Image d'archives
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Edité par
Cambridge University Press, 2009
ISBN 10 : 0521117925
ISBN 13 : 9780521117920
Ancien ou d'occasion
paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA80005211179256
Quantité disponible : 1 disponible(s)