direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Bachelor

Berechenbarkeit und Komplexität

Beschreibung: (6 LP)

Absolventinnen und Absolventen dieses Moduls beherrschen den Umgang mit Turingmaschinen und weiteren Modellen der Berechenbarkeit. Sie besitzen ein  Grundverständnis der Berechenbarkeit von Entscheidungsproblemen und  grundlegender Komplexitätsklassen. Sie sind befähigt, die Komplexität ausgewählter Problembeispiele zu beurteilen. Entsprechende Aufgabenstellungen können sie sowohl selbständig als auch in Kleingruppen bearbeiten.

Veranstaltung
Zeit
Lehrperson
Ort
Sprache
2 SWS
Vorlesung
Fr 10-12
Prof. Dr. Rolf Niedermeier
HE101
deutsch

Organisation:

  • Eine Anmeldung im ISIS ist aus organisatorischen Gründen erforderlich. Bitte beachten Sie, dass diese Anmeldung Sie nicht von der regulären Prüfungsanmeldung befreit.
  • Modulbeschreibung 

Programmierpraktikum: Wettbewerbsorientierte Algorithmik

Description: (6 CP)

On successful completion, students know:
 - advantages and disadvantages of different data structures to represent graphs, in particular adjacency lists and matrices.
 - implementations of fundamental graph algorithms, in particular various variations of breadth-first search.
 - approaches to solve showcase problems like computing paths, finding separators, and identifying important subgraphs. 

This course provides a basic preparation for participation in programming contests, e.g. the International Collegiate Programming Contest (ICPC).

 

Event
Time
Lecturer
Location   
Language
4 SWS project
Thur 14-16
Fri 14-18 (irregular)
Philipp Zschoche
C230
TEL 106


english

Organization:

  • A registration with ISIS is necessary. Please note that registration with the Prüfungsamt is still mandatory.
  • The default language is english. If all participants prefer german, the course can be held in german.
  • Module description
  • Modulbeschreibung

Bachelor and Master

Algorithm Engineering für schwere Probleme

Beschreibung: (9 LP)

Der Kurs
  - gibt eine Einführung in die grundlegenden Techniken des Algorithm Engineering, insbesondere für NP-schwere Probleme,
  - lehrt Design, Analyse, Implementierung und Test von Algorithmen und
  - gibt Einblick in Problemmodellierung und Lösungsmethoden wie Suchbaumalgorithmen, Datenreduktionstechniken und Vorverarbeitung, exakte, approximative und heuristische Algorithmen und Strategien basierend auf linearem Programmieren (unter Benutzung von etablierten Solvern).

 

The course
  - gives an introduction to the basic techniques of Algorithm Engineering, with a particular focus on NP-hard problems,
  - helps to design, analyze, and implement algorithms, and
  - provides insight into problem modeling and solution strategies including search tree algorithms, data reduction techniques, preprocessing, approximation, heuristics, and approaches based on linear programming (using established solvers).

 

Event
Time
Lecturer
Location
Language
2 SWS
Lecture
Fr 14-16
Dr. André Nichterlein
TEL 512
german/ english
4 SWS
Practical course
Wed 14-18
NN
TEL 512


german/ english

Organisation:

Master

Parameterized Algorithmics

Description: (6 CP)

 

Graduates of this module

  • know the approach of parameterized complexity analysis for solving NP-hard computational problems,
  • are able to design and analyze parameterized algorithms, and

  • can use complexity-theoretic methods to determine the limits of parameterized algorithmics.

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

Event
Time
Lecturer
Location
Language
4 SWS
Lecture + Tutorial
Tue 14-16
Wed 10-12
Dr. Vincent Froese
BH-N 128
MA 043
german/english

Organization:

To top

Advanced Algorithmics

Description: (9 CP)

 

Students who have completed this module can design and analyze algorithms for computational problems arising in various application contexts. When facing a concrete computational problem, they are able to choose, from a wide range of techniques, a solution strategy to efficiently solve the problem.
This includes in particular strategies for solving problems that are computationally hard in the worst case.

Particular topics are:

  • algorithmic decision theory,
  • algorithmic graph theory,
  • computational geometry,
  • algorithms for strings,
  • approximation and online algorithms,
  • parameterized and exact algorithms,
  • randomized algorithms and analysis,
  • universal solvers,
  • distributed algorithms,
  • algorithmic data mining
  • algorithms for massive data,
  • quantum computation.
Event
Time
Lecturer
Location
Language
6 SWS
Lecture + Tutorial
Mo 10-12
Tue 16-18
Fr 12-14


Dr. André Nichterlein,
Dr. Robert Bredereck


Mo: MA004
Tue + Fr: EB301


german/english

Organization:

Für Interessierte

(Bachelor, Master, Externe)

Research Colloquium on Algorithms and Complexity

Description: (3 CP)

 

In this seminar recent research of our group and special invited guests is presented. The main topics are parameterized algorithmics and complexity. The seminar is an excellent opportunity for advanced students to get in touch with current topics in our research field.

Students that participate in the seminar and also present a current publication in algorithmic research can receive 3 ECTS credit points.

Event
Zeit
Lecturer
Speaker
Location
Language
2 SWS
Colloquium
Thu 16-18
Prof. Dr. Rolf Niedermeier
Guests,
PhD students,
students
TEL 512
german/english

Zusatzinformationen / Extras