Mohlo by se vám také líbit

Více informací o knize Paradigms for Fast Parallel Approximability

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 125 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Computer architecture & logic design

• Plný název: Paradigms for Fast Parallel Approximability
• Autor: Josep DíazMaria SernaPaul SpirakisJacobo Torán
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 168
• EAN: 9780521117920
• ISBN: 0521117925
• ID: 02022655
• Nakladatelství: Cambridge University Press
• Hmotnost: 280 g
• Rozměry: 244 × 170 × 9 mm
• Datum vydání: 30. July 2009

Oblíbené z jiného soudku

---

---

---