Contacto
Como comprar
Entrega
Guia de compras
Paradigms for Fast Parallel Approximability
Inglês
129 b
Em breve
Data desconhecida
Política de devolução de 30 dias
Os clientes também compraram
/
Capa mole
6.78
€
/
Livro de capa dura
12.45
€
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.
Sobre o livro
Inglês
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Livro de capa dura
103.91
€
/
Capa mole
46.58
€
/
Capa mole
24.80
€
/
Capa mole
22.17
€
/
Capa mole
11.03
€
