e-Learning Support
Lecture: 03-IBAT-ALG Advanced Algorithms - Details

Lecture: 03-IBAT-ALG Advanced Algorithms - Details

Close message box
You are not logged into Stud.IP.

General information

Course name Lecture: 03-IBAT-ALG Advanced Algorithms
Subtitle
Course number 03-IBAT-ALG
Semester SoSe 2025
Current number of participants 34
Home institute Informatik
Courses type Lecture in category Teaching
First date Monday, 07.04.2025 12:00 - 14:00, Room: MZH 1470
Type/Form
Pre-requisites This course builds on the foundational algorithms course "Algorithmentheorie" (03-IBGT-THI1-AT).
Englischsprachige Veranstaltung Ja
ECTS points 6

Rooms and times

MZH 1470
Monday: 12:00 - 14:00, weekly (11x)
MZH 1100
Wednesday: 08:00 - 10:00, weekly (13x)
MZH 5500
Wednesday: 08:00 - 10:00, weekly (1x)

Module assignments

Comment/Description

https://lvb.informatik.uni-bremen.de/ibat/03-ibat-alg.pdf
Algorithms are a fundamental part of computer science. An algorithm is an abstract description of a procedure for solving a problem. Understanding how to design efficient algorithms is an essential skill for developing complex programs, models, and applications.

This course assumes basic knowledge of algorithm design principles and algorithm analysis. Building on these foundatinos, we explore faster and more sophisticated algorithms for well-known problems such as
- network flows, and
- maximum matchings in bipartite graphs.

Beyond these, we study more general problems and develop algorithms to solve them, including:
- minimum-cost flows, 
- maximum matchings in general graphs, and
- stable matchings.

Additionally, we introduce new concepts that model a broad class of fundamental problems and explore fast meta-algorithms for them. These topics include:
- linear programming and the ellipsoid method, and
- matroids, the Greedy algorithm, and matroid intersection.

The goals of this course are to provide a broad overview of fundamental problems in algorithmics and combinatorial optimization. Moreover, participants will develop a strong toolkit for designing and analyzing efficient algorithms, well beyond the standard undergraduate level in algorithm theory.

Registration mode

After enrolment, participants will manually be selected.

Potential participants are given additional information before enroling to the course.