Autumn Semester 2020 takes place in a mixed form of online and classroom teaching.
Please read the published information on the individual courses carefully.

272-0300-00L  Algorithmics for Hard Problems

SemesterSpring Semester 2019
LecturersH.‑J. Böckenhauer, R. Kralovic
Periodicitytwo-yearly recurring course
Language of instructionGerman
CommentThis course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science A.


AbstractThis course unit looks into algorithmic approaches to the solving of hard problems, particularly with moderately exponential-time algorithms and parameterized algorithms.

The seminar is accompanied by a comprehensive reflection upon the significance of the approaches presented for computer science tuition at high schools.
ObjectiveTo systematically acquire an overview of the methods for solving hard problems. To get deeper knowledge of exact and parameterized algorithms.
ContentFirst, the concept of hardness of computation is introduced (repeated for the computer science students). Then some methods for solving hard problems are treated in a systematic way. For each algorithm design method, it is discussed what guarantees it can give and how we pay for the improved efficiency. A special focus lies on moderately exponential-time algorithms and parameterized algorithms.
Lecture notesUnterlagen und Folien werden zur Verfügung gestellt.
LiteratureJ. Hromkovic: Algorithmics for Hard Problems, Springer 2004.

R. Niedermeier: Invitation to Fixed-Parameter Algorithms, 2006.

M. Cygan et al.: Parameterized Algorithms, 2015.

F. Fomin, D. Kratsch: Exact Exponential Algorithms, 2010.