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.
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
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.
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521117920
Quantità: Più di 20 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Paperback. Condizione: 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. Codice articolo LU-9780521117920
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: 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. . . . . Codice articolo V9780521117920
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521117920_new
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521117920
Quantità: Più di 20 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: 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. Codice articolo V9780521117920
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521117920
Quantità: 1 disponibili
Da: moluna, Greven, Germania
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
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Paradigms for Fast Parallel Approximability | Josep Diaz (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2009 | Cambridge University Press | EAN 9780521117920 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Codice articolo 101629829
Quantità: 5 disponibili
Da: Rarewaves.com UK, London, Regno Unito
Paperback. Condizione: 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. Codice articolo LU-9780521117920
Quantità: Più di 20 disponibili