Efficient Approximation and Online Algorithms

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.

Publication Year: 2006
Imprint: Springer Berlin Heidelberg
Format: P
Weight (Gram): 557