Recomienda este artículo a tus amigos:
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Evripidis Bampis
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Evripidis Bampis
Provides an opportunity for computer science practitioners and researchers to get in sync with the trends in the field of combinatorial optimization and online algorithms. This book focuses on the design of efficient approximation and on-line algorithms.
349 pages, biography
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 6 de febrero de 2006 |
| ISBN13 | 9783540322122 |
| Editores | Springer-Verlag Berlin and Heidelberg Gm |
| Páginas | 349 |
| Dimensiones | 156 × 234 × 19 mm · 508 g |
| Lengua | Francés |