Maximilian Probst: Catalogue data in Spring Semester 2023 |
| Name | Dr. Maximilian Probst |
| Name variants | Maximilian Probst Gutenberg |
| Address | Professur Theoretische Informatik ETH Zürich, OAT Z 14.2 Andreasstrasse 5 8092 Zürich SWITZERLAND |
| maximilian.probst@inf.ethz.ch | |
| URL | https://sites.google.com/view/maximilianprobst/home |
| Department | Computer Science |
| Relationship | Lecturer |
| Number | Title | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|
| 263-4400-00L | Advanced Graph Algorithms and Optimization  | 10 credits | 3V + 3U + 3A | R. Kyng, M. Probst | |
| Abstract | This course will cover a number of advanced topics in optimization and graph algorithms. | ||||
| Learning objective | The course will take students on a deep dive into modern approaches to graph algorithms using convex optimization techniques. By studying convex optimization through the lens of graph algorithms, students should develop a deeper understanding of fundamental phenomena in optimization. The course will cover some traditional discrete approaches to various graph problems, especially flow problems, and then contrast these approaches with modern, asymptotically faster methods based on combining convex optimization with spectral and combinatorial graph theory. | ||||
| Content | Students should leave the course understanding key concepts in optimization such as first and second-order optimization, convex duality, multiplicative weights and dual-based methods, acceleration, preconditioning, and non-Euclidean optimization. Students will also be familiarized with central techniques in the development of graph algorithms in the past 15 years, including graph decomposition techniques, sparsification, oblivious routing, and spectral and combinatorial preconditioning. | ||||
| Prerequisites / Notice | This course is targeted toward masters and doctoral students with an interest in theoretical computer science. Students should be comfortable with design and analysis of algorithms, probability, and linear algebra. Having passed the course Algorithms, Probability, and Computing (APC) is highly recommended, but not formally required. If you are not sure whether you're ready for this class or not, please consult the instructor. | ||||