Semester | Sommersemester 2021 |
Modulnummer | INF-ALG-27 |
Veranstaltungsnummer | INF-ALG-015 , INF-ALG-016 |
Studiengänge | Wirtschaftsinformatik Master, Informatik Master, Informations-Systemtechnik Master |
IBR Gruppe | ALG (Prof. Fekete) |
Art | Vorlesung & Übung |
Dozent | |
Assistenten | Dr. Phillip Keldenich Wissenschaftlicher Mitarbeiter keldenich[[at]]ibr.cs.tu-bs.de +49 531 3913112 Raum 317 |
LP | 5 |
SWS | 2+1+1 |
Ort & Zeit | Lecture: Online, Tuesday 3 PM - 4:30 PM. |
Beginn | First lecture: Tuesday, 20.4.2021, 3 PM. |
Voraussetzungen | Prerequisites are knowledge of algorithms and data structures, basic graph problems and graph algorithms (e.g., as provided in the lecture "Netzwerkalgorithmen"); basic knowledge from theoretical computer science (NP-completeness) are helpful, but will definitely be supplemented. |
Scheinerwerb | Homework assignments throughout the semester (Studienleistung) and an oral exam (probably online) at the end of the semester (Prüfungsleistung). |
Inhalt | Many interesting and natural algorithmic problems (e.g., the Traveling Salesman Problem) are NP-complete - hence, we cannot expect to find a "perfect" algorithm that (i) always and (ii) fast finds (iii) an optimal solution. However, hard problems still need to be solved! In this class we consider algorithms that do not necessarily find an optimal solution, but that (i) always and (ii) fast find a (iii) provably good solution. Among the topics of this class are:
In the context of various problems, a wide spectrum of techniques and concepts will be provided. |
General Information
Video recordingsFor the first lectures, we will make use of video recordings of the previous version of this course. Please do not hesitate to contact us if there are any problems with the videos. If you do encounter a problem while playing the recordings in your browser, consider downloading the video and playing it in a regular video player.
SlidesIn addition to the videos, the lecture slides are also available below.
Homework SetsThe homework assignment sheets can be found below.
LiteratureThe first part of the lecture will be on classic results for which the following books can be useful.
The second part of the lecture will be on recent results for which the corresponding papers will be announced in due time. Mailing ListThere will be a mailing list. We will distribute the homework sets and other announcements via this list, so, please subscribe! You may also want to check out the alg-studs mailing list which is similar to cs-studs but for algorithmic students. |
Technische Universität Braunschweig
Universitätsplatz 2
38106 Braunschweig
Postfach: 38092 Braunschweig
Telefon: +49 (0) 531 391-0