Share
efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications (in English)
Evripidis Bampis
(Illustrated by)
·
Klaus Jansen
(Illustrated by)
·
Claire Kenyon
(Illustrated by)
·
Springer
· Paperback
efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications (in English) - Bampis, Evripidis ; Jansen, Klaus ; Kenyon, Claire
$ 52.09
$ 54.99
You save: $ 2.90
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
It will be shipped from our warehouse between
Thursday, June 06 and
Friday, June 07.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications (in English)"
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% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.