Algorithm Design

The course explores algorithmic paradigms and methods that enable the development of efficient polynomial-time algorithms. Key paradigms discussed include greedy algorithms, divide and conquer, dynamic programming, and local search. These paradigms are used to develop efficient exact and approximation algorithms for a variety of problems motivated by real-life applications. Additionally, the course covers basic computational complexity concepts that establish theoretical limits on what can be solved efficiently.

Details

Code	43124
Type	Course
ECTS	5
Site	Fribourg
Track(s)	T4 – Theory and Logic
Semester	S2025

Teaching

Learning Outcomes	By the end of this course, students should be able to: Design and implement efficient algorithms using key paradigms such as greedy algorithms, divide and conquer, dynamic programming, and local search. Develop both exact and approximation algorithms to solve real-world problems efficiently. Analyze the performance of algorithms and understand the trade-offs between optimality and computational feasibility. Apply basic concepts of computational complexity to determine the theoretical limits of efficient algorithms.
Lecturer(s)	Clément Dallard
Language	english
Course Page	The course page in ILIAS can be found at https://ilias.unibe.ch/goto_ilias3_unibe_crs_3129149.html.

Schedules and Rooms

Period	Weekly
Schedule	Thursday, 09:15 - 12:00
Location	UniFR, RM 01
Room	C-01.108

Additional information

Comment

First Lecture The first lecture will be announced later.