Algorithmics for Hard Problems

Abstract

This seminar looks into modern algorithmic approaches for solving computationally hard problems; e.g., approximation algorithms, moderately exponential-time algorithms, parameterized algorithms and combinations thereof. The focus will be on approaches with provable performance guarantees.

Objective

To systematically acquire an overview of the methods for solving hard problems with provable performance guarantees. To get deeper knowledge of both approximation algorithms and exact and parameterized algorithms.

Content

In this seminar, we will discuss algorithmic approaches for solving computationally hard problems. In the kick-off meeting, we will give a brief overview of these approaches, including approximation algorithms and parameterizations. 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 basic design techniques for approximation algorithms as well as exponential and parameterized algorithms, and some modern approaches of combining these techniques. We will focus on techniques for which certain worst-case performance guarantees can be proven.

Resources