Algorithmics

CS 550 Algorithmik I

Spring Semester 2020 | 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.


Announcement regarding the corona virus pandemic

Dear participants of the course CS 550 Algorithmics in the spring semester 2020,

as you know, the classroom teaching at the university is suspended from Monday, March 16, 2020 until (expected) April 19, 2020 due to the corona pandemic . This concerns our Algorithmics lectures on

Tuesday, March 17, 2020 Thursday, March 19, 2020 Tuesday, March 24, 2020
Tuesday, March 31, 2020 Thursday, April 2, 2020  

and the tutorial on Thursday, March 26, 2020.

It is the stated goal of both the university and my person that, by providing appropriate online materials, you will be put in a position to take all exams planned for this semester without major didactic disadvantages. Of course, this goal can only be achieved through a dialog-oriented process which requires your active participation. We are currently planning the following measures.

  1. The platform for this process is the ILIAS system and the website of course CS 550, on which the teaching materials described below are provided. Please visit these pages regularly, because the corresponding files are constantly updated. 
  2. For clarifying organizational and content issues please contact us via e-mail, which we try to answer promptly. Please refrain from personal visits to our offices or phone calls.
  3. To enable you to work at an individual pace, in a first step the entire script of the lecture and all corresponding exercise sheets are provided. Please note that also these documents are constantly updated.
  4. In addition, video files are created and made available, in which the material of the initially omitted five lectures is explained by me. The accompanying examples that I normally show on the blackboard are suitably integrated into the script and the explainations. Please understand that these files will not be made available in time with the actual lectures at least this week. We have to familiarize ourselves with the technical matter first.
  5. For the tutorials video files, in which the solutions of the exercises are explained, will be created, too. You can also send us your solutions to the exercises for correction and commenting as a PDF file in advance of the tutorial via email.
     

Best wishes, stay healthy


Matthias Krause


News

  • 2020-03-11: Due to the Coronavirus pandemic all classes are cancelled until 20 April.
  • 2020-03-02: Due to illness, the lecture for tomorrow, Tuesday, March 3, is cancelled.
  • 2020-02-29: The time and location of the lecture was changed from Monday 10:15 - 11:45 in B 6, A 1.01 to Tuesday 12:00 - 13:30 in B 6, D 0.07.
  • 2020-02-29: The exam review for the resit exam of the fall semester 2019 will take place on Thursday, March 5, at 14:00 in room B 6, B 2.01. If you wish to review your exam please register by Wednesday, March 4, via e-mail to Alexander Moch.
  • 2020-02-17: The room for the lecture on thursday was changed to A 5, C 0.15.

Lecture


Tutorials


Literature

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