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.
| ISBN-13: | 9783540322122 |
| ISBN-10: | 3540322124 |
| Publisher: | Springer Science & Business Media |
| Publication date: | 2006-02-06 |
| Edition description: | 2006 |
| Pages: | 347 |
| Product dimensions: | Height: 9.25 Inches, Length: 6.1 Inches, Weight: 1.127 Pounds, Width: 0.82 Inches |
| Author: | Evripidis Bampis |
| Language: | en |
| Binding: | Paperback |
Discover more books in the same category
