Schedule

Overview Talk: Rado Matroids in Matroid Center Problems. 

Laura Vargas Koch

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem

Svenja M. Griesbach

Discounted games and break-points

Alexander Kozachinskiy

Open Problem Session 1

Open Problem Session 2

Work Session

Overview Talk 2: Stochastic Load Balancing & Related Problems

Franziska Eberle

Valid Cuts for the Design of Potential-based Flow Networks

Lea Strubberg

Open Problem Session 3

Work Session

Work Session

A Unified Framework for Symmetry Handling in Mathematical Programs

Jasper van Doornmalen

Deterministic Impartial Selection with Weights

Maximilian Stahlberg

Work Session

Alpha-clairvoyant Flow Time Minimization

Jens Schlöter

Algorithms for Secretaries under Contraction and Truncation 

Vasilis Livanos

Work Session

Work Session

A Linear Time Gap-ETH-Tight Approximation Scheme for TSP in the Euclidean Plane 

Tobias Mömke

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding

Sharat Ibrahimpur

Work Session

Approximating Prize-collecting Variant of TSP

Morteza Alimi

Identifying and Controlling Solutions in Combinatorial Optimization

Jannik Matuschke

Work Session

Work Session

Approximation Results for the Toll-Booth Problem

Philipp Pabst

Sensitivity for separable quadratic function minimization over an integral polymatroid base polytope 

Katharina Eickhoff

Unified Algorithms for Clustering Problems with Norm Objectives
Joachim Spoerhase

Shortest odd paths in undirected graphs with conservative weight function

Shortest odd paths in undirected graphs with conservative weight function

Maribel Mendoza

Work Session