Efficient Approximation And Online Algorithms: Recent Progress On Classical Combinatorial Optimization Problems And New Applications (lecture Notes In Computer Science)

Efficient Approximation And Online Algorithms: Recent Progress On Classical Combinatorial Optimization Problems And New Applications (lecture Notes In Computer Science)
by Evripidis Bampis / / / PDF


Read Online 4.3 MB Download


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.

views: 609