186.855 Fixed-Parameter Algorithms and Complexity
Diese Lehrveranstaltung ist in allen zugeordneten Curricula Teil der STEOP.
Diese Lehrveranstaltung ist in mindestens einem zugeordneten Curriculum Teil der STEOP.

2019W, VU, 2.0h, 3.0EC, wird geblockt abgehalten

Merkmale

  • Semesterwochenstunden: 2.0
  • ECTS: 3.0
  • Typ: VU Vorlesung mit Übung

Lernergebnisse

Nach positiver Absolvierung der Lehrveranstaltung sind Studierende in der Lage...

After successful completion of the course, students will be able to understand the theory of parameterized complexity and fixed-parameter tractability in sufficient depth to read and follow latest developments in the area and, crucially, to analyze problems they encounter from the parameterized viewpoint. First and foremost, this includes the ability to obtain asymptotically efficient algorithms and strong lower bounds for problems of interest.

Inhalt der Lehrveranstaltung

Fixed-parameter algorithms provide a powerful approach for efficiently solving many NP-hard problems by exploiting structural aspects of problem instances in terms of a problem parameter. This course provides an overview of the main techniques for developing fixed-parameter algorithms (including bounded search trees, kernelization, color coding, modulators) as well as the fundamentals of parameterized complexity theory (such as the Weft-hierarchy, XP and para-NP-hardness, kernelization lower bounds) which allows to provide strong evidence that certain problems cannot be solved by a fixed-parameter algorithm.

Methoden

The core of the course consists of a series of blocked lectures which explore advanced topics in the studied area. The lectures are held in an informal, seminar-like setting and are highly interactive - students are expected to actively engage in what's going on. Every new method and technique introduced during the lecture is demonstrated on several examples.

Prüfungsmodus

Schriftlich und Mündlich

Weitere Informationen

The course information meeting and first lecture start on Monday 7 January at 12:00 in the von Neumann seminar room.

The course will be held blocked in January 2019 and all lectures except for the first will take place in library/seminar room of the Algorithms and Complexity Group (room HB0408 at Favoritenstrasse 9-11). The course will take place:

  • on three consecutive Mondays (7.1., 14.1., 21.1.) from 12:00 to 16:00; as an exception, on Monday 14.1. the course starts at 13:30,
  • on three consecutive Thursdays (10.1., 17.1., 24.1.) from 14:00 to 18:00.

There will be a break in the middle of each block (specific timing is up for discussion).

Vortragende

Institut

LVA Termine

TagZeitDatumOrtBeschreibung
Di.11:00 - 15:0007.01.2020 - 21.01.2020Seminarraum FAV EG C (Seminarraum Gödel) Fixed-Parameter Algorithms and Complexity (Presentations + Backup)
Do.14:00 - 18:0009.01.2020 - 23.01.2020Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mo.12:00 - 16:0013.01.2020 - 27.01.2020Seminarraum FAV EG B (Seminarraum von Neumann) Lecture
Fixed-Parameter Algorithms and Complexity - Einzeltermine
TagDatumZeitOrtBeschreibung
Di.07.01.202011:00 - 15:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Do.09.01.202014:00 - 18:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mo.13.01.202012:00 - 16:00Seminarraum FAV EG B (Seminarraum von Neumann) Lecture
Di.14.01.202011:00 - 15:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Do.16.01.202014:00 - 18:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mo.20.01.202012:00 - 16:00Seminarraum FAV EG B (Seminarraum von Neumann) Lecture
Di.21.01.202011:00 - 15:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Do.23.01.202014:00 - 18:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mo.27.01.202012:00 - 16:00Seminarraum FAV EG B (Seminarraum von Neumann) Lecture
LVA wird geblockt abgehalten

Leistungsnachweis

The grading is based on a two-step evaluation process. In the first and mandatory part, each student is expected to select a recent research paper (based on guidance from the lecturer) from the considered area, read it, and prepare a presentation of its contents. This is sufficient to pass the course with a basic grade. Students who want a good grade take an oral exam where they demonstrate their understanding of the topics covered in the lecture.

LVA-Anmeldung

Von Bis Abmeldung bis
13.01.2020 00:01 17.01.2020 23:59 17.01.2020 23:59

Curricula

Literatur

Es wird kein Skriptum zur Lehrveranstaltung angeboten.

Vorkenntnisse

This course requires basic knowledge on the design and analysis of algorithms as well as basic complexity theory. Knowledge of the topics covered in the Algorithmics course is an advantage.

Vorausgehende Lehrveranstaltungen

Sprache

Englisch