Online Algorithms

Every second year from summer term 2016
Lecture: Tuesday, 1:15 - 2:45 PM in Room SN 19.4
Tutorial: Monday every other week, 1:15 - 2:45 PM starting from the 16th of April in Room SN 19.4
Small tutorial: Monday every other week 1:15 - 2:45 PM, starting from the 23rd of April in Room SN 19.4

The first lecture will take place on the 10th of April at 1:15 PM in Room SN 19.4.

none

Successful participation in written homework assignments and final oral exam.

The exam type has now been fixed. The final exam will be oral.

Participants will learn fundamental modeling, design and analysis of online algorithms.
Topics include:

1. Competitive Analysis
2. Self-Organizing Data Structures
3. Distributed Paging
4. Online Scheduling
5. Robot Motion Planning (Exploration, Search)
6. Online Packing.

In the lecture - among other sources - the book "Online Algorithms, State of the Art" by Fiat/Woeginger (1998) is used.

Another book on Online Algorithms is "Online Computation and Competitive Analysis" by Borodin/El-Yaniv.

Exercise sheets

• Exercise sheet 0 (not graded)
• Exercise sheet 1
• Exercise sheet 2
• Exercise sheet 3
• Exercise sheet 4
• Exercise sheet 5

Material site

Lecture- and tutorial recordings are made available to the participants on the password protected material site. The password will be announced in the first big tutorial. Students that cannot attend the first big tutorial, especially students at other universities, can contact us via mail to obtain the password.

Mailing list

There is a mailing list for this lecture. Please subscribe, as we will use it to spread information on short notice.