252-4910-00L  Algorithmics for Hard Problems

SemesterSpring Semester 2020
LecturersH.‑J. Böckenhauer, R. Kralovic
Periodicityyearly recurring course
Language of instructionEnglish
CommentThe deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.

Number of participants limited to 24.


252-4910-00 SAlgorithmics for Hard Problems2 hrs
21.02.15:15-17:00CAB H 53 »
H.‑J. Böckenhauer, R. Kralovic

Catalogue data

AbstractThis seminar looks into modern algorithmic approaches for solving computationally hard problems; e.g., approximation algorithms, moderately exponential-time algorithms, parameterized algorithms and combinations thereof. The focus will be on approaches with provable performance guarantees.
ObjectiveTo systematically acquire an overview of the methods for solving hard problems with provable performance guarantees. To get deeper knowledge of both approximation algorithms and exact and parameterized algorithms.
ContentIn this seminar, we will discuss algorithmic approaches for solving computationally hard problems. In the kick-off meeting, we will give a brief overview of these approaches, including approximation algorithms and parameterizations.

Then, each participant will study one aspect of this topic, following a specific scientific publication, and will give a presentation about this topic. The topics will include basic design techniques for approximation algorithms as well as exponential and parameterized algorithms, and some modern approaches of combining these techniques. We will focus on techniques for which certain worst-case performance guarantees can be proven.
LiteratureThe literature will consist of textbook chapters and original research papers and will be provided during the kick-off meeting.
Prerequisites / NoticeThe participants should be familiar with the content of the lectures "Algorithmen und Datenstrukturen" (252-0026-00) and "Theoretische Informatik" (252-0057-00).

The presentations will be given in the form of a block course in the first week of June 2020.

The language can be mixed in German and English in the following sense: The teaching material will be in English, but it will be possible for at least half of the participants to give their presentations and hand in their written summaries in German.

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits2 credits
ExaminersH.-J. Böckenhauer, R. Kralovic
Typegraded semester performance
Language of examinationEnglish
RepetitionRepetition only possible after re-enrolling for the course unit.
Additional information on mode of examinationThe participants will give a 30 minute presentation about their topic, followed by a 10 minute discussion. Moreover, they will hand in a written two-page summary. Both the presentation and the summary will be graded.
It is mandatory to attend the presentations of all participants and to actively participate in the discussions.

Learning materials

No public learning materials available.
Only public learning materials are listed.


No information on groups available.


Places24 at the most
PriorityRegistration for the course unit is until 26.02.2020 only possible for the primary target group
Primary target groupComputer Science BSc (252000)
Computer Science (Mobility) (274000)
Waiting listuntil 01.03.2020

Offered in

Computer Science BachelorSeminarWInformation