Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Paradigms for Fast Parallel Approximability
Angleščina
125 b
Do 30 dni za vračilo
Drugi so kupili tudi
/
Mehka
85.84
€
/
Mehka
30.15
€
/
Mehka
35.30
€
/
Mehka
13.81
€
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.
O knjigi
Angleščina
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Mehka
11.19
€
/
Mehka
9.78
€
/
Mehka
13.11
€
