Semester | |
Modulnummer | INF-ALG-14 |
Veranstaltungsnummer | INF-ALG-015 , INF-ALG-016 |
Studiengänge | Informatik Master, Informations-Systemtechnik Master, Wirtschaftsinformatik Master |
IBR Gruppe | ALG (Prof. Fekete) |
Art | Vorlesung & Übung |
Dozent | |
Assistent | |
LP | 5 |
SWS | 2+1+1 |
Ort & Zeit | Lecture: Tuesday 15:00-16:30 PK3.3 Vorlesung: 11.04.2017, Grosse Uebung: TBA, Kleine Uebung: TBA 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 theoretic computer science (NP-completeness) are helpful, but will definitely be supplemented. 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:
Announcements and Dates
General Information
Homework SetsThere will be biweekly mandatory homework. Please check the material area.Literature:The first part of the lecture will be on basic results for which the following books can be useful
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 similiar to cs-studs but for algorithmic students. MaterialIn the password protected material area you can find the video recordings of the lecture and further material as the slides of the tutorials. The password will be announced in the first lecture. |
Technische Universität Braunschweig
Universitätsplatz 2
38106 Braunschweig
Postfach: 38092 Braunschweig
Telefon: +49 (0) 531 391-0