![Loading Events](https://dimag.ibs.re.kr/cms/wp-content/plugins/the-events-calendar/src/resources/images/tribe-loading.gif)
- This event has passed.
Daniel Král’, Matroid depth and width parameters
August 6 Tuesday @ 4:30 PM - 5:30 PM KST
Depth and width parameters of graphs, e.g., tree-width, path-width and tree-depth, play a crucial role in algorithmic and structural graph theory. These notions are of fundamental importance in the theory of graph minors, fixed parameter complexity and the theory of sparsity.
In this talk, we will survey structural and algorithmic results that concern width and depth parameters of matroids. We will particularly focus on matroid depth parameters and discuss the relation of the presented concepts to discrete optimization. As an application, we will present matroid based algorithms that uncover a hidden Dantzig-Wolfe-like structure of an input instance (if such structure is present) and transform instances of integer programming to equivalent ones, which are amenable to the existing tools in integer programming.
The most recent results presented in the talk are based on joint work with Marcin Briański, Jacob Cooper, Timothy F. N. Chan, Martin Koutecký, Ander Lamaison, Kristýna Pekárková and Felix Schröder.