Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Couverture souple

 
9783540322122: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Autres éditions populaires du même titre

9783540820475: Efficient Approximation and Online Algorithms

Edition présentée

ISBN 10 :  3540820477 ISBN 13 :  9783540820475
Editeur : Springer, 2008
Couverture souple