Fortæl dine venner om denne vare:
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
Pris
DKK 528
Bestilles fra fjernlager
Forventes klar til forsendelse 15. - 25. jun.
Tilføj til din iMusic ønskeseddel
eller
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
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| Udgivet | 6. februar 2006 |
| ISBN13 | 9783540322122 |
| Forlag | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sider | 349 |
| Mål | 156 × 234 × 19 mm · 508 g |
| Sprog | Fransk |
Mere med Evripidis Bampis
Vis alleMere med samme udgiver
Se alt med Evripidis Bampis ( f.eks. Paperback Bog )