TU BRAUNSCHWEIG
| Carl-Friedrich-Gauß-Fakultät | Informatik
Informatikzentrum

Approximation Algorithms

SemesterSommersemester 2012 [ Andere Semester: Sommer 17 · Sommer 15 · Sommer 09 ]
Modulnr.INF-ALG-14
Veranst.Nr. INF-ALG-015 , INF-ALG-016
Studieng.Master Informatik, Master Informations-Systemtechnik, Master Wirtschaftsinformatik
IBR Gruppe(n)ALG (Prof. Fekete)
ArtVorlesung/Übung
Dozent
PhotoProf. Dr. Sándor P. Fekete
Abteilungsleiter
s.fekete[[at]]tu-bs.de
+49 531 3913111
Raum 335
Assistent
PhotoDr. Christiane Schmidt
Ehemalige Wissenschaftliche Mitarbeiterin
cschmidt[[at]]ibr.cs.tu-bs.de
LP5
SWS2+1+1
Ort & Zeit

Lecture: Tuesday, 15:00 - 16:30 Room IZ161
Exercises: Thursday, 15:00 - 16:30, Room IZ161, start: TBA.
Small Tutorial: Wednesday, 16:45 - 18:15, Room IZ161.

Beginn

Vorlesung: 17.04.2012, Grosse Uebung: 26.04.2012, Kleine Uebung: 02.05.2012

Voraussetzungen
Scheinerwerb (Homework assignments during the semester, and)* an oral exam at the end. (*=Studienleistung)
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. 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. Among the topics of this class are: (1) A basic introduction to NP-completeness and approximation (2) Approximation for vertex and set cover (3) Packing problems (4) Tour problems and variations (5) Current research problems In the context of various problems, a wide spectrum of techniques and concepts will be provided.

Announcements and Dates

    General Information

    • Two lectures will take place in the tutorial slot: lecture from June 12, on June 14; and lecture from June 19 on June 25.
    • Schedule of all lectures, tutorials etc.: [PDF] [12.04.12]

    Homework Sets

    Literature:

    • Vazirani, Vijay V.: Approximation Algorithms, Springer-Verlag, 2001.
    • Approximation Algorithms for NP-hard problems edited by Dorit S. Hochbaum, more info.

    mailing list

  • There is a mailing list. We will distribute the homework sets and other announcements via this list, so, please subscribe! In case of technical difficulties pleas send an email to Christiane.
  • material for the class

    material for the class (videos)


    aktualisiert am 06.07.2012, 18:42 von Dr. Christiane Schmidt
    printemailtop