Mathematical Seminar: Discrete Optimization

Summer 2023
Lecturer: Max Klimm
More information and materials: ISIS course page

Content

In this course, we discuss recent developments of discrete optimization. Each participant is expected to give a 30min presentation of a paper accepted at the 2022 ACM Symposium on Theory of Computing (STOC) and write a short summary of the paper. Possible topics are

• algorithms and data structures
• computational complexity
• randomness in computing
• algorithmic graph theory and combinatorics
• approximation algorithms
• continuous and discrete optimization
• economics and computation
• computational geometry

Prerequisites

Having completed (parts of) the lecture series "Algorithmic Discrete Mathematics" (ADM I, ADM II, ADM III) is certainly helpful but not formally required.