Efficient Approximation and Online Algorithms
Download or Read eBook Efficient Approximation and Online Algorithms PDF written by Evripidis Bampis and published by Springer Science & Business Media. This book was released on 2006-02-06 with total page 355 pages. Available in PDF, EPUB and Kindle.
| Author | : Evripidis Bampis |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 355 |
| Release | : 2006-02-06 |
| ISBN-10 | : 9783540322122 |
| ISBN-13 | : 3540322124 |
| Rating | : 4/5 (22 Downloads) |
Book Synopsis Efficient Approximation and Online Algorithms by : Evripidis Bampis
Book excerpt: 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.
