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 - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540322122 - 6. februar 2006
Če se naslovnica in naslov ne ujemata, je naslov pravilen

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

Cena
€ 59,99

Naročeno iz oddaljenega skladišča

Predvidena dobava 31. mar - 14. apr
Dodaj na svoj seznam želja iMusic

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

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 6. februar 2006
ISBN13 9783540322122
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 349
Dimenzije 156 × 234 × 19 mm   ·   508 g
Jezik Francoščina  

Več od Evripidis Bampis

Prikaži vse