- Institute of Operating Systems and Computer Networks
- News
- About us
- Connected and Mobile Systems
- Distributed Systems
- Algorithms
- Microprocessor Lab
- Education
- Services
- Spin-Offs
- Research Cooperations
Combinatorial Algorithms
Semester | Winter 2010/2011 |
Module # | INF-ALG-11 |
Event # | INF-ALG-027, INF-ALG-028 |
Programmes | Computer Science Master, Computer and Communication Systems Engineering Master, Business Information Systems Master |
IBR Group | ALG (Prof. Fekete) |
Type | Lecture & Exercise |
Lecturer | Dr. Alexander Kröller Ehemaliger Juniorprofessor |
Assistant | Dr. Christiane Schmidt Ehemalige Wissenschaftliche Mitarbeiterin |
Credits | 5 |
Hours | 2+1 |
Time & Place | Lecture: Tuesday, 11:30 - 13:00 Room SN 19.2 |
Start | First Lecture: Tuesday, October 26 First Tutorial: Thursday, November 4 |
Prerequisites | None. |
Certificates | Homework assignments during the semester, and an exam at the end (either written or oral, will be decided in the first lectured). |
Content | This course focusses on advanced algorithmic techniques and combinatorial structures. Based on the theory of matroids, we will gently touch the topics of other algorithm courses (esp. Netzwerk- and Approximationsalgorithmen, and Mathematische Methoden) and discuss links between them. We will further explore these connections, revealing common underlying combinatorial structures. Prior knowledge from some of the aforementioned courses is beneficial, but not neccessary. We will (re-) introduce all concepts in class. We will speak English in class. Students are encouraged (but not required) to use English in exercises and exams as well. |
References | |
Aktuelles
MailinglisteHausaufgaben
weitere Materialien: |