Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Paradigms for Fast Parallel Approximability
Angielski
127 b
Zapowiedź
Termin nieznany
Nawet do 30 dni na zwrot
Klienci kupili także
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
45.99
€
/
Miękka
24.49
€
/
Miękka
21.89
€
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?