Loading Events

« All Events

  • This event has passed.
:

Daniel Král’, Matroid depth and width parameters

August 6 Tuesday @ 4:30 PM - 5:30 PM KST

Room B332, IBS (기초과학연구원)

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.

Details

Date:
August 6 Tuesday
Time:
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:

Venue

Room B332
IBS (기초과학연구원) + Google Map

Organizer

Sang-il Oum (엄상일)
View Organizer Website
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.