Gå direkte til innholdet
Efficient Approximation and Online Algorithms
Efficient Approximation and Online Algorithms
Spar

Efficient Approximation and Online Algorithms

Engelsk
Les i Adobe DRM-kompatibelt e-bokleserDenne e-boka er kopibeskyttet med Adobe DRM som påvirker hvor du kan lese den. Les mer
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.
Undertittel
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
ISBN
9783540322139
Språk
Engelsk
Utgivelsesdato
24.1.2006
Tilgjengelige elektroniske format
  • PDF - Adobe DRM
Les e-boka her
  • E-bokleser i mobil/nettbrett
  • Lesebrett
  • Datamaskin