Design of Efficient Algorithms
Introduction
This module deals with efficient algorithms, optimisation, and approximation algorithms.
Contents
Architecture and implementation of formal systems for the design of efficient algorithms, correctness-preserving optimisation, programme verification and synthesis. Design and analysis of approximation algorithms.
Learning Objectives
Students will be familiar with and understand basic techniques of formal programme development and its implementation. Students will be able to anticipate efficiency problems when designing algorithms and respond accordingly. Students will write better programmes that are highly optimised in their runtime-critical areas. Students will be able to analyse simple approximation methods in terms of their quality. They understand basic design techniques such as greedy, local search, scaling and methods based on linear programming and can also apply these to new problems.
Examination Methods
- Either a 90-minute written exam.
- Or a 30 minute oral examination.
Sources & Implementations:
Similar Modules
- Effiziente Algorithmen (FernUniversität in Hagen)
- Algorithm Engineering Lab (Friedrich-Schiller-Universität Jena)
- Algorithms II (Karlsruher Institut für Technologie)
- Algorithmen I (Karlsruher Institut für Technologie)
- Analyse von Algorithmen (Wahlpflichtfach) (Rheinisch-Westfälische Technische Hochschule Aachen)
- Effiziente Algorithmen (Wahlpflichtfach) (Rheinisch-Westfälische Technische Hochschule Aachen)
- Algorithm Engineering (Ruprecht-Karls-Universität Heidelberg)
- Entwurf effizienter Algorithmen (Universität Potsdam)
- Efficient Algorithms (Universität zu Köln)