User Tools

Site Tools


teaching:ws2021:aa

This is an old revision of the document!


Advanced Algorithms

Lecturer Prof. Dr. Petra Mutzel, Dr. Daniel Schmidt
Module MA-INF 1104
eCampus tba
BASIS 612111104

Topics

We will explore advanced techniques for the design and the analysis of algorithms with selected examples from classical as well as modern algorithmics. Our discussion will include both polynomial time and exponential time exact algorithms, as well as approximation algorithms for combinatorial optimization problems (often on graphs) and their analysis.

We will discuss techniques such as amortized analysis, duality of linear programs, integer linear programming, and techniques for big data (e.g. parallel algorithms, streaming algorithms). Topics will include algorithms for (time-expanded) network flows, min-cost flows, streaming for bipartite matching, parallel shortest paths, traveling salesman problem, linear ordering, and data structures such as, e.g., Fibonacci heaps, Union-Find, (Cuckoo) Hashing, and their analysis.

Dates

Subject When Where Start Lecturer
Lectures Tuesday 12-14 and Thursday 10-12 Online via Zoom 27.10.2020 Prof. Dr. Petra Mutzel, Dr. Daniel Schmidt

Tutorials

The lectures are accompanied by tutorials. There are two alternative appointments. You only need to attend one of the appointments. The assignment of the attendees to these appointments will be done after the first lecture. Details about the assignment procedure will be announced here soon.

Subject When Where Start Lecturer
Tutorial 1 Tuesday 14-16 Online via BBB 03.11.2020 Dahn, Oettershagen
Tutorial 2 Thursday 12-14 Online via BBB 05.11.2020 Dahn, Oettershagen

Exam

There will be a written exam in the usual exam period.

teaching/ws2021/aa.1601026602.txt.gz · Last modified: 2020/09/25 11:36 by petra.mutzel

Page Tools