Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Evripidis Bampis
-25% su kodu BOOKS
Pristatymas per 10-16 d.d.
30 dienų grąžinimo politika
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 p ... Visas aprašymas
Jums taip pat gali patikti
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.
Daugiau informacijos
| Autorius | Evripidis Bampis |
|---|---|
| Leidėjas | Springer Science & Business Media |
| Išleidimo metai | 2006 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9783540322122 |