Algorithm Engineering for graph-based data clusteringModule description #40320 / Version 4
- 9 CP
- Oral exam
- Graded
- Winter semester
- German
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v13)
| Module / Version | #40320 / #4 |
|---|---|
| Validity | SS 2015 – SS 2015 |
| Available language(s) | German |
| Credit points | 9 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | EN 23 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | lehre@akt.tu-berlin.de |
| Website | https://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen |
Learning outcomes
On successful completion, students will be able to:
- develop efficient algorithms for computationally hard (NP-hard) graph problems
- estimate the running time and space of algorithms
- use standard algorithm libraries and tools to engineer their algorithms
- work in teams
- document their work in adequate fashion
- present the main features of their implementation
- develop efficient algorithms for computationally hard (NP-hard) graph problems
- estimate the running time and space of algorithms
- use standard algorithm libraries and tools to engineer their algorithms
- work in teams
- document their work in adequate fashion
- present the main features of their implementation
Content
Learning Content:
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 for NP-hard data clustering problems.
- provides insight into problem modeling and solution strategies including search tree algorithms, data reduction techniques, preprocessing, approximation, heuristics, and approaches based on linear programming (including tool support).
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 for NP-hard data clustering problems.
- provides insight into problem modeling and solution strategies including search tree algorithms, data reduction techniques, preprocessing, approximation, heuristics, and approaches based on linear programming (including tool support).
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Algorithm Engineering für graphbasiertes Datenclustern | Project | 0434 L 215 / 1 | Winter semester | – | 6 | ISIS |
Workload and credit points
Algorithm Engineering für graphbasiertes Datenclustern (Project)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 8 h | 120 h |
| Vor- und Nachbereitung | 15 | 10 h | 150 h |
| 270 h | |||
The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.
Description of teaching and learning methods
Regelmäßiger Wechsel von Wissens- und Methodenvermittlung in der Vorlesung und Projektarbeit in
Kleingruppen. Diese umfasst regelmäßige Projektbesprechung, Präsentation von Milestones und
Wettbewerbe um schnellsten Lösungscode.
Kleingruppen. Diese umfasst regelmäßige Projektbesprechung, Präsentation von Milestones und
Wettbewerbe um schnellsten Lösungscode.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Es wird Kenntnis der Module “Grundlagen und algebraische Strukturen”, “Berechenbarkeit und
Komplexität”, “Algorithmische und funktionale Lösung diskreter Probleme”, “Datenstrukturen und
Algorithmen im imperativen Stil” und “Softwaretechnik” vorausgesetzt.
Komplexität”, “Algorithmische und funktionale Lösung diskreter Probleme”, “Datenstrukturen und
Algorithmen im imperativen Stil” und “Softwaretechnik” vorausgesetzt.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | German |
Exam description
Mündliche Prüfung (MP).
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
The maximum capacity of participants is 15.
Registration procedures
Die Anmeldung erfolgt über QISPOS (für BSc Informatik) bzw. direkt beim Prüfungsamt.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Hinweis: Vorlesungsfolien sind unter www.isis.tu-berlin.de verfügbar.
Recommended literature
No recommended literature given
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified