Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Advanced AlgorithmicsModule description #40025 / Version 5

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v8)
Module / Version#40025 / #5
ValidityWS 2017/18 – Winter semester 2021/22
Available language(s)English
Credit points9
Person responsible for the moduleNiedermeier, Rolf
GradingGraded
Exam formatWritten exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeEN 23
Contact personNichterlein, André
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen

Learning outcomes

Students who have completed this module can design and analyze algorithms for computational problems arising in various application contexts. When facing a concrete computational problem, they are able to choose, from a wide range of advanced techniques, a strategy to efficiently solve the problem.
This includes strategies for solving problems that are computationally hard in the worst case. In particular, the students know about current research topics in algorithmics.

Content

Introduction to advanced and modern topics of algorithm design and analysis, with a particular emphasis on coping with presumable worst-case intractability.
Particular topics include:
- algorithmic game theory,
- algorithmic graph theory,
- approximation and online algorithms,
- computational geometry,
- computational social choice,
- distributed algorithms,
- online algorithms,
- parameterized and exact algorithms,
- randomized algorithms and analysis,
- universal solvers.

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Advanced AlgorithmsIntegrated course0434 L 237 Winter semester–6 ISIS

Workload and credit points

Advanced Algorithms (Integrated course)

Workload descriptionMultiplierHoursTotal
Präsenzzeit156 h90 h
Vor-/Nachbereitung1510 h150 h
240 h

Course-independent workload

Workload descriptionMultiplierHoursTotal
Prüfungsvorbereitung130 h30 h
30 h

The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.

Description of teaching and learning methods

The course consists of roughly 2/3 lecture and 1/3 tutorial parts; in the tutorials concrete problems are solved together.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

a) obligatory: basic knowledge on algorithm design
b) desirable: basic understanding of P vs. NP classification

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatWritten exam
LanguageEnglish
Duration/Extent90 min

Duration of the module

The following number of semesters is estimated for taking and completing the module: 1 semester(s).

This module can be started in the following semesters: Winter semester.

Maximum number of participants

This module is not limited to a number of students.

Registration procedures

Please register at QISPOS or directly at the Examination Office

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

available – Slides will be made available during the lecture period

Recommended literature

  • *Current research literature specified during the lecture. Basic textbooks:
  • Cormen, Thomas H.; Stein, Clifford; Leiserson, Charles E.; Rivest, Robert L.: Introduction to Algorithms. 3rd Edition, 2009, The MIT Press
  • Kleinberg, Jon; Tardos, Éva: Algorithm Design, 2006, Pearson/Addison-Wesley
  • Niedermeier, Rolf: Invitation To Fixed-Parameter Algorithms. 2006, Oxford University Press
  • Skiena, Steven S.: The Algorithm Design Manual, 2nd Edition, 2008, Springer Verlag
  • Williamson, David P.; Shmoys, David B.: The Design Of Approximation Algorithms. 2011, Cambridge University Press

Assigned programs

This module version is used in the following programs:

Program / program versionSemester(s)Curriculum component
Industrial Engineering and Management
Industrial Engineering and Management (M. Sc.) - StuPO 2015
SS 2020Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks
WS 2020/21Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks
SS 2021Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks
WS 2021/22Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks
SS 2022Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks

Miscellaneous

Not specified