Software Engineering for Efficient Optimization Algorithms
Overview
| Instructor |
Prof. Dr. rer. nat. Volker Turau
Christian Renner Christoph Weyer |
| Course Format |
2
hours
seminar |
| ECTS credit points | 2.0 |
| Workload | 60 hours total |
| Performance record | Exercises and presentation of solutions |
| Period | Summer term |
| Language | German |
| Stud.IP |
|
Content
Optimization is a frequent desire in every day's life, e.g., consider the travelling time from one place to another using public transportation, or imagine you were playing poker and wanted to know the best strategy to maximize your wins for any hand you're playing. These questions can be answered by optimization algorithms. However, for huge amounts of input data or large computational loads imposed by the algorithms, efficient implementation will be required to obtain fast solutions. This seminar will combine these two topics: We intend to deepen your understanding of common optimization algorithms and their efficient implementation. For this purpose, we will analyze one type of problem from the International Collegiate Programming Contest (ICPC) in each of the weekly seminar sessions. Furthermore, one student presents strategies for assessing and solving the current given problem by actually presenting an efficient solution. In turn, we will prepare a second problem for each type for you to solve during the seminar hours.
The list of problems and algorithms encompasses, but is not restricted to:
- Simple math problems and possible simplifications
- Graphs: Trees, DFS, BFS
- Graphs: Dijkstra, A*
- Graphs: Connected sets, Matching
- Maximum Flow
- Dynamic Programming
Additional Information
The seminar will start with a preparation session in April, 4th 2012, at 2 pm in room E 4.083. Attending this session is required for participation in the seminar.
