Paradigms Fast Parallel Approximability by Díaz Josep (13 results)

Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Edition 1997. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1997. Ammareal gives back up to 15% of this item's net price to charity organizations.…

Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1997. Tome 8. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 1997. Volume 8. Ammareal gives back up to 15% of this item's net price to charity organizations.…

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.…

Condition: New.

Condition: New. In English.

Condition: New. pp. viii + 158 32 Illus.

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. …

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.…

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.…

paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

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.…

Taschenbuch. Condition: 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. …