Kostenloser Versand
Bequem zahlen
Wir sind gerne für Sie daVarious 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.
Produkteigenschaften
- Artikelnummer: 9780521117920
- Medium: Buch
- ISBN: 978-0-521-11792-0
- Verlag: Cambridge University Press
- Erscheinungstermin: 14.04.2009
- Sprache(n): Englisch
- Auflage: Erscheinungsjahr 2009
- Serie: Cambridge International Series on Parallel Computation
- Produktform: Kartoniert, Paperback
- Gewicht: 302 g
- Seiten: 168
- Format (B x H x T): 170 x 244 x 9 mm
- Ausgabetyp: Kein, Unbekannt
Themen
- Mathematik | Informatik
- EDV | Informatik
- Programmierung | Softwareentwicklung
- Funktionale, Logische, Parallele und Visuelle Programmierung
- Mathematik | Informatik
- EDV | Informatik
- Programmierung | Softwareentwicklung
- Funktionale, Logische, Parallele und Visuelle Programmierung
- Mathematik | Informatik
- EDV | Informatik
- Programmierung | Softwareentwicklung
- Algorithmen & Datenstrukturen