Articoli correlati a Paradigms for Fast Parallel Approximability
Sinossi
A survey of the basic techniques for approximating combinatorial problems using parallel algorithms.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
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
Descrizione del libro
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 44,89
EUR 3,40 per la spedizione in U.S.A.
Destinazione, tempi e costiRisultati della ricerca per Paradigms for Fast Parallel Approximability
Foto dell'editore
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2215580243832
Quantità: Più di 20 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9780521117920
Quantità: 2 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability (Paperback)
Editore:
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
Nuovo
Paperback
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521117920
Quantità: 1 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation, Series Number 8)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521117920_new
Quantità: Più di 20 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability (Cambridge International Series on Parallel Computation)
Editore:
Cambridge University Press 2009-06-16, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
Nuovo
Paperback
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521117920
Quantità: 10 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 1st edition. 166 pages. 9.50x6.70x0.40 inches. In Stock. This item is printed on demand. Codice articolo __0521117925
Quantità: 1 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 168. Codice articolo 18535495
Quantità: 4 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability (Paperback)
Editore:
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521117920
Quantità: 1 disponibili
Immagini fornite dal venditore
Paradigms for Fast Parallel Approximability
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 446926519
Quantità: Più di 20 disponibili
Foto dell'editore
Paradigms for Fast Parallel Approximability (Paperback)
Editore:
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521117925
ISBN 13: 9780521117920
Nuovo
Paperback
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521117920
Quantità: 1 disponibili