https://www.dagstuhl.de/23291

16. – 21. Juli 2023, Dagstuhl-Seminar 23291

Parameterized Approximation: Algorithms and Hardness

Organisatoren

Karthik C. S. (Rutgers University – New Brunswick, US)
Parinya Chalermsook (Aalto University, FI)
Joachim Spoerhase (MPI für Informatik – Saarbrücken, DE)
Meirav Zehavi (Ben Gurion University – Beer Sheva, IL)

Auskunft zu diesem Dagstuhl-Seminar erteilen

Susanne Bach-Bernhard zu administrativen Fragen

Michael Gerke zu wissenschaftlichen Fragen

Motivation

Parameterization and approximation are two popular approaches of coping with intractability in combinatorial optimization. They have gained substantial maturity over the last decades, leading to tight bounds for many fundamental computational problems and beautiful algorithmic techniques that show surprising interplay between algorithms and various areas of mathematics. In this Dagstuhl Seminar, we study parameterized approximation as a relatively new algorithmic paradigm that combines these two popular research areas. In particular, we analyze the solution quality (approximation ratio) as well as the running time of an algorithm in terms of a parameter that captures the “complexity” of a problem instance.

While the field has grown and yielded some promising results, our understanding of the area is rather ad-hoc compared to our knowledge in approximation or parameterized algorithms alone. The goal of this seminar is to work towards bridging this gap. We want to bring together researchers from both communities in order to accommodate the unification of scientific knowledge. (i) We aim at fostering a transfer of techniques between the classic fields of approximation and parameterization. We will discuss how recent developments in one research area can be transferred to another. The exchange of state-of-the-art techniques will be achieved through several invited tutorials that will be delivered by top experts in the two fields. (ii) We plan to systematically identify new research programs and concrete open problems in research areas that are relevant to parameterized approximation. This goal will be achieved through several panel discussions led by experts in selected areas. (iii) We will bolster the creation of new collaborations between researchers in the two communities by encouraging the participants to actively discuss the suggested directions for open problems. In particular, we will reserve time slots for research discussions dedicated for this purpose.

Motivation text license
  Creative Commons BY 4.0
  Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, and Meirav Zehavi

Classification

  • Computational Complexity
  • Data Structures And Algorithms
  • Discrete Mathematics

Keywords

  • Combinatorial Optimization
  • Approximation Algorithms
  • Parameterized Complexity
  • Hardness of Approximation

Dokumentation

In der Reihe Dagstuhl Reports werden alle Dagstuhl-Seminare und Dagstuhl-Perspektiven-Workshops dokumentiert. Die Organisatoren stellen zusammen mit dem Collector des Seminars einen Bericht zusammen, der die Beiträge der Autoren zusammenfasst und um eine Zusammenfassung ergänzt.

 

Download Übersichtsflyer (PDF).

Dagstuhl's Impact

Bitte informieren Sie uns, wenn eine Veröffentlichung ausgehend von Ihrem Seminar entsteht. Derartige Veröffentlichungen werden von uns in der Rubrik Dagstuhl's Impact separat aufgelistet  und im Erdgeschoss der Bibliothek präsentiert.

Publikationen

Es besteht weiterhin die Möglichkeit, eine umfassende Kollektion begutachteter Arbeiten in der Reihe Dagstuhl Follow-Ups zu publizieren.