Algorithmics

CS 550 Algorithmik I

Spring Semester 2021 | English

Based on the module Algorithms and Data Structures, this course introduces advanced concepts and algorithms, treating correctness and costs. The focus is on economic applications, i.e., how to describe and solve given practical problems using appropriate algorithms. The question of problems which cannot be computed efficiently (P vs. NP) will be discussed and heuristics for NP-hard optimization problems will be introduced. Treated topics are linear programming, network algorithms, NP-completeness and the algorithmic treatment of NP-hard problems like the satisfiability problem and the travelling salesperson problem.


News

  • 2021-02-26: The first lecture will take place on Monday, 1 March 2021, 13:45 – 15:15 in WIM-ZOOM-15.
  • 2021-02-15: The course website for 2021 is online.

Question Time


Materials

The lecture slides and videos as well as the exercise sheets and their corresponding solutions are available in the lecture's ILIAS course.


Literature

  • Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms.
  • Ball, Magnanti, Monma, Nemhauser (eds.): Network Models (Handbooks in Operations Research and Management Science, Volume 7).