Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Bemærk venligst, at den normale 14 dages fortrydelsesret ophører ved modtagelse af adgang til e-bogen.
Produkt beskrivelse
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.
Oplysninger om tilgængelighed
Vælg variant af e-bog i højre side, for at se tilgængelighedsoplysninger.
Detaljer
- ISBN13 9783540322139
- Udgivet 2006
- Forlag Springer
- Format Elektronisk medie
- Udgave 1
- Sprog Engelsk