Contacto
Cómo comprar
Entrega
Guía de compras
Paradigms for Fast Parallel Approximability
Inglés
159 b
Próximamente
Fecha desconocida
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
8.29
€
/
Tapa dura
15.49
€
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 el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
55.89
€
/
Tapa blanda
31.99
€
/
Tapa blanda
27.69
€
/
Tapa blanda
13.59
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?