Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 09, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Stefan Weltge (IFOR)

Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank

The Chvátal-Gomory procedure is a classical proof technique to obtain valid linear inequalities for a set of integer points S, where the input is a description (by means of linear inequalities) of any polytope R whose set of integer points is S. In this work, we focus on the natural case where S is contained in \{0,1\}^n and R is contained in [0,1]^n. We prove that R has bounded CG-rank provided that S has bounded pitch and bounded gap, where the pitch is the minimum integer p such that all p-dimensional faces of the 0/1-cube have a nonempty intersection with S, and the gap is a measure of the size of the facet coefficients of conv(S). Furthermore, we illustrate how our result generalizes a recent theorem of Cornuéjols and Lee (IPCO 2016). This is joint work with Yohann Benchetrit, Samuel Fiorini and Tony Huynh.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login