Efficient Approximation and Online Algorithms
Evripidis Bampis
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.
Catégories:
Année:
2006
Editeur::
Springer Science & Business Media
Langue:
english
Pages:
347
ISBN 10:
6611391940
ISBN 13:
9786611391942
Collection:
Lecture Notes in Computer Science, 3484
Fichier:
PDF, 4.26 MB
IPFS:
,
english, 2006