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 - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540322122 - 2006. gada 6. februāris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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
€ 63,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 17. apr. - . gada 1. maijā
Pievienot savam iMusic vēlmju sarakstam

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2006. gada 6. februāris
ISBN13 9783540322122
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 349
Izmēri 156 × 234 × 19 mm   ·   508 g
Valoda Franču  

Vairāk no Evripidis Bampis

Rādīt visu