Book efficient approximation and online algorithms: recent progress on classical combinatorial optimizati Bampis, Evripidis ; Jansen, Klaus ; Kenyon, Claire

portada efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications

Type

Physical Book

Illustrated by

Publisher

Author

Bampis, Evripidis ; Jansen, Klaus ; Kenyon, Claire

Year

2006

Language

English

Pages

348

Format

Paperback

Dimensions

23.4 x 15.6 x 1.9 cm

Weight

0.51 kg.

ISBN

3540322124

ISBN13

9783540322122

Synopsis "efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications"

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.