252-4910-00L  Approximation Algorithms

SemesterSpring Semester 2023
LecturersH.‑J. Böckenhauer, R. Kralovic
Periodicityyearly recurring course
Language of instructionEnglish
CommentThe deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.



Courses

NumberTitleHoursLecturers
252-4910-00 SApproximation Algorithms2 hrs
23.02.16:15-18:00CAB H 52 »
05.06. - 07.06.09:15-18:00CAB G 52 »
H.‑J. Böckenhauer, R. Kralovic

Catalogue data

AbstractWe look into approximation algorithms for computationally hard discrete optimization problems. Their quality is measured by the approximation ratio, i.e., the worst-case ratio between the quality of the computed solution and an optimal one, depending on the input size. We explore different techniques for the design and analysis of approximation algorithms and the limits of this approach.
Learning objectiveTo systematically acquire an overview of the methods for the design and analysis of approxmation algorithms. To get deeper knowledge of the classification of optimization problems according to their approximability. To learn how to analyze the approximation ratio of approximation algorithms.To learn about the limits of the approximation approach.
ContentIn this seminar, we discuss how approximation can help to compute satisfactory solutions for computationally hard optimization problems. In the kick-off meeting, we will give a brief overview of modeling and classifying approximation algorithms.

Then, each participant will study one aspect of this topic, following a specific scientific publication, and will give a presentation about this topic. The topics will include design methods for approximation algorithms like greedy strategies, dynamic programming, or LP-based techniques as well as the classification of optimization problems according to their approximability. The considered problems will be well-known optimization tasks like satisfiability problems, routing problems, packing problems, etc.
LiteratureThe literature will consist of textbook chapters and original research papers and will be provided during the kick-off meeting.
Prerequisites / NoticeThe participants should be familiar with the content of the lectures "Algorithmen und Datenstrukturen" (252-0026-00) and "Theoretische Informatik" (252-0057-00).

The presentations will be given in the form of a block course in June 2023, preferrably shortly after the end of the normal lectures.

The language can be mixed in German and English in the following sense: The teaching material will be in English, but it will be possible for at least half of the participants to give their presentations and hand in their written summaries in German.
CompetenciesCompetencies
Subject-specific CompetenciesConcepts and Theoriesassessed
Method-specific CompetenciesAnalytical Competenciesassessed
Problem-solvingassessed
Social CompetenciesCommunicationassessed
Self-presentation and Social Influence assessed
Personal CompetenciesCritical Thinkingfostered
Self-awareness and Self-reflection fostered
Self-direction and Self-management fostered

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits2 credits
ExaminersH.-J. Böckenhauer, R. Kralovic
Typegraded semester performance
Language of examinationEnglish
RepetitionRepetition only possible after re-enrolling for the course unit.
Additional information on mode of examinationThe participants will give a 30 minute presentation about their topic, followed by a 10 minute discussion. Moreover, they will hand in a written two-page summary. Both the presentation and the summary will be graded.
It is mandatory to attend the presentations of all participants and to actively participate in the discussions.

Learning materials

 
Main linkSeminar Approximation Algorithms
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

Places24 at the most
PriorityRegistration for the course unit is until 01.03.2023 only possible for the primary target group
Primary target groupComputer Science BSc (252000)
Computer Science (Mobility) (274000)
Waiting listuntil 05.03.2023

Offered in

ProgrammeSectionType
Computer Science BachelorSeminarWInformation