Faites connaître cet article à vos amis:
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
| Médias | Livres Paperback Book (Livre avec couverture souple et dos collé) |
| Validé | 6 février 2006 |
| ISBN13 | 9783540322122 |
| Éditeurs | Springer-Verlag Berlin and Heidelberg Gm |
| Pages | 349 |
| Dimensions | 156 × 234 × 19 mm · 508 g |
| Langue et grammaire | Français |
Plus par Evripidis Bampis
Afficher toutMere med samme udgiver
Voir tous les Evripidis Bampis ( par ex. Paperback Book )