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 - Bøker - Springer-Verlag Berlin and Heidelberg Gm - 9783540322122 - 6. februar 2006
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

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

Pris
NOK 599

Bestillingsvarer

Forventes levert 28. mai - 11. jun
Legg til iMusic ønskeliste
eller

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

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 6. februar 2006
ISBN13 9783540322122
Utgivere Springer-Verlag Berlin and Heidelberg Gm
Antall sider 349
Mål 156 × 234 × 19 mm   ·   508 g
Språk Fransk  

Mer med Evripidis Bampis

Vis alle