This entry is from Winter semester 2019/20 and might be obsolete. You can find a current equivalent here.

# CS 627 — Advanced Algorithmics (dt. Höhere Algorithmik)

 Level, degree of commitment Specialization module, compulsory elective module Forms of teaching and learning,workload Lecture (4 SWS), recitation class (2 SWS), 270 hours (90 h attendance, 180 h private study) Credit points,formal requirements 9 CP Course requirement(s): Successful completion of at least 50 percent of the points from the weekly exercises as well as at least 2 presentations of the tasks. Examination type: Oral examination Language,Grading German,The grading is done with 0 to 15 points according to the examination regulations for the degree program M.Sc. Computer Science. Duration,frequency One semester, Regelmäßig alle 2 Semester Person in charge of the module's outline Prof. Dr. Christian Komusiewicz

## Contents

• Approximation and online algorithms
• Parameterized and exact algorithms
• Randomized algorithms
• Integer programming
• Distributed algorithms
• Algorithmic game theory
• Streaming algorithms and external memory

## Qualification Goals

The graduates of the module can

• Design algorithms for computational problems from various application domains
• Select an adequate algorithmic approach from a range of advanced algorithmic techniques for a specific computational problem,
• Evaluate the quality of algorithms in different analysis models,
• Prove the algorithmic difficulty of computational problems.

## Prerequisites

None. The competences taught in the following modules are recommended: either Algorithms and Data Structures or Practical Informatics II: Data Structures and Algorithms for Pre-Service-Teachers, Efficient Algorithms.

## Applicability

The module can be attended at FB12 in study program(s)

• M.Sc. Data Science
• M.Sc. Computer Science
• M.Sc. Mathematics

When studying M.Sc. Computer Science, this module can be attended in the study area Specialization Modules in Computer Science.

The module can also be used in other study programs (export module).

Die Wahlmöglichkeit des Moduls ist dadurch beschränkt, dass es der Theoretischen Computer Science zugeordnet ist.

• Kleinberg, Tardos. Algorithm Design. Pearson/Addison-Wesley, 2006.
• Skiena, Steven S. The Algorithm Design Manual. Springer Verlag, 2008.
• Cygan et al. Parameterized Algorithms. Springer Verlag, 2015.
• Williamson, Shmoys. The Design Of Approximation Algorithms. Cambridge University Press, 2011.