Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications| By: | Evripidis Bampis; Klaus Jansen; Claire Kenyon |
| Publisher: | Springer Nature |
| Print ISBN: | 9783540322122 |
| eText ISBN: | 9783540322139 |
| Edition: | 1 |
| Copyright: | 2006 |
| Format: | Page Fidelity |
Lifetime - $68.74
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
Details
Table of Contents
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.