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 - Knihy - Springer-Verlag Berlin and Heidelberg Gm - 9783540322122 - 06. február 2006
V prípade, že obal a názov nesedia, platí názov

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

Objednané zo vzdialeného skladu

Očakávané doručenie 1. - 15. apr
Pridať do vášho zoznamu prianí na 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

Médium Knihy     Paperback Book   (Kniha s mäkkou väzbou a lepeným chrbtom)
Vydané 06. február 2006
ISBN13 9783540322122
Vydavatelia Springer-Verlag Berlin and Heidelberg Gm
Strany 349
Rozmery 156 × 234 × 19 mm   ·   508 g
Jazyk Francúzština  

Viac od Evripidis Bampis

Zobraziť všetko