Effiziente Algorithmen und Datenstrukturen II

What it is about

You will learn advanced algorithmic methods focusing on linear optimization and techniques for solving combinatorial problems. In the end you will be able to formulate linear models, apply classical solution methods such as the Simplex method and advanced methods like Ellipsoid and Karmarkar methods, and use approximation and rounding approaches for NP-complete problems.

What you will be able to do

• Model and solve linear optimization
• Apply Simplex and Seidel methods
• Understand the Ellipsoid method and Karmarkar's algorithm
• Design and deploy approximation algorithms
• Apply greedy, local search, and rounding methods
• Use primal/dual methods for combinatorial optimization

What the module consists of

• VorlesungDelivery of theoretical content through lectures and presentations
• ÜbungDeepening through problem sheets, discussion of solutions, and individual feedback

Teaching method

• Vortrag/Präsentationfor structured conveyance of lecture content
• Übungsaufgabenfor active engagement with topics and to check learning progress
• Korrektur mit individuellem Feedbackto provide targeted feedback on learning progress