In this seminar, we cover modern randomized algorithms for knapsack and packing problems. Topics range from approximation schemes and randomized rounding to online and random-order models, as well as geometric and multidimensional variants.

The first meeting takes place on April 14, 12 ct. In this meeting we will present the topics in more detail.

If you are interested in participating in the seminar, please send an e-mail to Tim Sinen and come to the first meeting. Also, you may join the eCampus course for additional infos and materials.

If you would like to participate in the seminar but cannot attend the first meeting, please send us an e-mail.