Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Please note that the standard 14-day cancellation right terminates upon receiving access to the e-book.
Product description
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.
Accessibility information
Select variation, to see accessibility information
Details
- ISBN13 9783540322139
- Released 2006
- Publisher Springer
- Format Elektronisk medie
- Edition 1
- Language English