Efficient Approximation and Online Algorithms
- Išparduota
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
0
/https://libri-media.knygos-static.lt/5958715b-a23a-4a56-bd3f-c8b10a16fc5a/1)
- Leidėjas: Springer-Verlag GmbH
- Metai: 2006
- ISBN-10: 3540322124
- ISBN-13: 9783540322122
- Formatas: 15.7 x 23.9 x 2.2 cm, kieti viršeliai
- Kalba: Anglų
Efficient Approximation and Online Algorithms | knygos.lt
Atsiliepimai
Aprašymas
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Išparduota
- Leidėjas: Springer-Verlag GmbH
- Metai: 2006
- ISBN-10: 3540322124
- ISBN-13: 9783540322122
- Formatas: 15.7 x 23.9 x 2.2 cm, kieti viršeliai
- Kalba: Anglų
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Atsiliepimai