Conférences  >  Mathématiques  >  Optimisation, recherche opérationnelle  >  Allemagne

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Many discrete optimization problems can be modelled as graph problems, leading to a long list of well-studied problems, which include graph partitioning, covering and packing problems, network design problems, width parameter problems, and so on. Most of these graph problems are computationally hard. However, this situation may change if we require the input to belong to some special graph class. This leads to two fundamental questions, which lie at the heart of our Dagstuhl Seminar: for which classes of graphs can a computationally hard graph problem be solved in polynomial time, and for which classes of graphs does the problem remain hard? In our seminar, we aim to discover new insights that lead to results for a whole range of problems rather than just for a single problem alone.

Graph Algorithms, Graph Classes, Graph Containment, Relations, Parameterized Complexity, Width Parameters

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Géométrie et topologie,    Réseaux de neurones et intelligence artificielle, apprentissage automatique