Lehrinhalte
introduction to online optimization, list access, paging, randomized online algorithms, Yao's principle, load balancing and online scheduling, k-server problems

Literatur
Borodin, El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 2005.
Amos Fiat, Gerhard J. Woeginger. Online Algorithms: The State of the Art. Springer, 1998.

Voraussetzungen
recommended: Introduction to Optimization

Semester: WT 2018/19