You might also like

More about Paradigms for Fast Parallel Approximability

• Book details
• Synopsis
• Trending among others

You get 125 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer science Computer architecture & logic design

• Full title: Paradigms for Fast Parallel Approximability
• Author: Josep DíazMaria SernaPaul SpirakisJacobo Torán
• Language: English
• Binding: Paperback
• Number of pages: 168
• EAN: 9780521117920
• ISBN: 0521117925
• ID: 02022655
• Publisher: Cambridge University Press
• Weight: 280 g
• Dimensions: 244 × 170 × 9 mm
• Date of publishing: 30. July 2009

Trending among others

---

---

---