Moses - Parametrisierte Algorithmik

Display language

Diese Modulbeschreibung gilt nicht im aktuellen Semester.

Die Modulbeschreibung gilt nur für den Zeitraum SS 2014 - WS 2014/15. Die Version für das aktuelle Semester (SoSe 2024) finden Sie hier: Modulbeschreibung des SoSe 2024

Module / Version:
#40627 / #1

Validity:
SS 2014 - WS 2014/15

Default display language:
English

Module title:
Parametrisierte Algorithmik
Parameterized Algorithmics

Credits:
6

Responsible person:
Niedermeier, Rolf

Grading:
benotet

Type of exam:
Mündliche Prüfung

Zugehörigkeit

Faculty:
Fakultät IV

Institute:
Institut für Softwaretechnik und Theoretische Informatik

Area of expertise:
34351100 FG Algorithmik und Komplexitätstheorie

Prüfungsausschuss:
No information

Kontakt

Office:
TEL 5-1

Contact person:
Thielcke, Christlinde

E-mail address:
lehre@akt.tu-berlin.de

Website:

http://www.akt.tu-berlin.de/menue/teaching

Learning Outcomes

Participants of the module * know the approach of parameterized complexity analysis for solving NP-hard computational problems, * are able to design and analyse parameterized algorithms, and * can use complexity-theoretic methods to determine the limits of parameterized algorithmics. The course is principally designed to impart: technical skills 50%, method skills 50%, system skills 0%, social skills 0%

Content

Particular topics include * algorithms for exactly solving NP-hard optimization problems by exploiting important problem parameters such as solution size * NP-hard computational problems on graphs and networks and on strings * algorithmic techniques such as preprocessing by data reduction, depth-bounded search trees, color coding, iterative compression, tree decomposition of graphs

Module Components

Pflichtteil:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Parameterized Algorithmics	IV		WiSe/SoSe	No information	4

Workload and Credit Points

Parameterized Algorithmics (IV):

Workload description	Multiplier	Hours	Total
Präsenzzeit	15.0	4.0h	60.0h
Vor-/Nachbereitung	15.0	8.0h	120.0h
			180.0h(~6 LP)

The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

Description of Teaching and Learning Methods

The course material is presented in lectures. The lectures are accompanied by tutorials in which an active participation and homework on the distributed work sheets is required.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic knowledge on algorithms

Mandatory requirements for the module test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Oral exam

Language

English

Duration/Extent

No information

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Winter- und Sommersemester.

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 literature
Jörg Fl um, Martin Grohe: Parameterized Complexity Theory . Springer, Berlin 2006.
Rod G. Downey, Michael R. Fellows: Parameterized Complexity . Springer, New York 1999.
Rolf Niedermeier: Invitation to Fixed - Parameter Algorithms . Oxford Univ. Press, Oxford 2006.

Assigned Degree Programs

Semester:

Zeige auch ausgelaufene Studiengänge und StuPOs

This module is used in the following Degree Programs (new System):

	Studiengang / StuPO	StuPOs	Verwendungen	Erste Verwendung	Letzte Verwendung
This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.

Computer Science diploma Technical Computer Science diploma

Miscellaneous