Data & IT
Pocket
Efficient Approximation and Online Algorithms
Evripidis Bampis • Klaus Jansen • Claire Kenyon
749:-
Uppskattad leveranstid 10-15 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Pocket/Paperback
- ISBN: 9783540322122
- Språk: Engelska
- Antal sidor: 348
- Utgivningsdatum: 2006-02-01
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K