Instructors: Prof. Dr. Petra Berenbrink
Event type: Lecture
Displayed in timetable as: BKA - VL
Hours per week: 3
Language of instruction: German
Min. | Max. participants: - | 240
Comments/contents: Most natural optimization problems are NP-hard. Their exact solution is prohibitively time consuming, under NP ?= P. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. The lecture consists of two parts. We present an introduction to complexity theory with focus on NP-completeness and an introduction to combinatorial approximation algorithms.