This course provides an overview of various topics in algorithms based on a selection of materials on exact, geometric, randomized, and approximation algorithms, as well as advanced data structures. As such, this course serves as a foundation for the associated master's level courses. The course covers improvements to classical algorithms as well as approaches to tackle NP-hard problems. These approaches range from understanding "good" algorithms that solve such problems exactly, to efficient algorithms that approximate such problems, to randomized approaches that work well in expected value. Along the way, we will learn about some interesting data structures that can be exploited for this purpose.

At the end of this course, students should have a rough overview of advanced topics in algorithms and data structures. They should be able to analyze and design algorithms of any type and understand the appropriate use of data structures.

Registration:

If you want to attend this lecture, please enroll here in WueCampus (rightmost item in the bar below the course title: "Mich in diesem Kurs einschreiben"). During the course of the semester, registration in WueStudy will be opened for the exam.