Efficient Approximation and Online Algorithms (eBook, PDF)

Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Redaktion: Bampis, Evripidis; Kenyon, Claire; Jansen, Klaus

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 348
• Erscheinungstermin: 24. Januar 2006
• Englisch
• ISBN-13: 9783540322139
• Artikelnr.: 44130083