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 introductory meeting takes place on April 14, 12:00 ct.

If you are interested in participating in the seminar, please send an e-mail to Tim Sinen and come to the first meeting.

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