Zobacz książki o podobnej tematyce

Powiadomienie o dostępności

Więcej informacji o Paradigms for Fast Parallel Approximability

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 214 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Computing & information technology Computer science Computer architecture & logic design

• Pełny tytuł: Paradigms for Fast Parallel Approximability
• Autor: Josep DíazMaria SernaPaul SpirakisJacobo Torán
• Język: Angielski
• Oprawa: Twarda
• Liczba stron: 166
• EAN: 9780521431705
• ISBN: 0521431700
• ID: 02030664
• Wydawca: Cambridge University Press
• Waga: 465 g
• Wymiary: 255 × 179 × 15 mm
• Data wydania: 10. July 1997

Ulubione w innej kategorii

---

---

---