Richard Kralovic: Catalogue data in Spring Semester 2020

Name	Dr. Richard Kralovic
Address	Professur Algorithmen und Didaktik ETH Zürich, CAB F 13.1 Universitätstrasse 6 8092 Zürich SWITZERLAND
E-mail	rkralovi@inf.ethz.ch
Department	Computer Science
Relationship	Lecturer

Number	Title	ECTS	Hours	Lecturers
252-4910-00L	Algorithmics for Hard Problems The 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.	2 credits	2S	H.‑J. Böckenhauer, R. Kralovic
Abstract	This 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.
Learning objective	To 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.
Content	In 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.
Literature	The literature will consist of textbook chapters and original research papers and will be provided during the kick-off meeting.
Prerequisites / Notice	The 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.