The mailing list from previous semesters will be continued.
You can register
here.
This course is on algorithms for scenarios with incomplete information.
Prerequisites are a basic knowledge of and an interest in discrete
optimization, e.g., as taught in the courses on Optimization I and II.
Other interested and motivated students are welcome.
``Online Algorithms - the State of the Art'' by
Amos Fiat
and
Gerhard Woeginger.
Springer Lecture Notes in Computer Science,
vol. 1442, 1998, ISDN 3-540-64917-4.
Last modified: Wed Mar 10 09:35:11 CET 2004
<sandor.fekete AT tu-bs.de>