Dutch Seminar on Optimization (online series) with Celine Swennenhuis (TU/E) and Sophie Huiberts (CWI)

The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. These lectures will be given by Celine Swennenhuis (TU/E) and Sophie Huiberts (CWI). The lecture of Celine Swennenhuis is entitled "A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins", and the lecture of Sophie Huiberts is entitled "Combinatorial Diameter of Random Polytopes". Please visit the seminar website for more information.
  • Dutch Seminar on Optimization (online series) with Celine Swennenhuis (TU/E) and Sophie Huiberts (CWI)
  • 2021-05-27T16:00:00+02:00
  • 2021-05-27T17:00:00+02:00
  • The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. These lectures will be given by Celine Swennenhuis (TU/E) and Sophie Huiberts (CWI). The lecture of Celine Swennenhuis is entitled "A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins", and the lecture of Sophie Huiberts is entitled "Combinatorial Diameter of Random Polytopes". Please visit the seminar website for more information.

The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. 

Speakers:  Celine Swennenhuis (TU/E) and Sophie Huiberts (CWI)

Title of the talk of Celine Swennenhuis: A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins
Abstract of the talk of Celine Swennenhuis:
In the Bin Packing problem one is given n items with different weights and m bins with a given capacity; the goal is to distribute the items over the bins without exceeding the capacity.
Björklund, Husfeldt and Koivisto (SICOMP 2009) presented an O(2^n) time algorithm for Bin Packing. In this paper we show that for every m there exists a constant s_m > 0 such that an instance of Bin Packing with m bins can be solved in O((2-s_m)^n) time.

Title of the talk of Sophie Huiberts: Combinatorial Diameter of Random Polytopes
Abstract of the talk of Sophie Huiberts:
The combinatorial diameter of a polytope is the maximum shortest path between any two vertices of the polytope, in the graph consisting of that polytope's vertices and edges. This diameter is closely related to the simplex method for linear programming and has been studied since the 1950's, when Hirsch asked in a letter to Dantzig whether the combinatorial diameter of a polytope in R^n with m facets has diameter at most m-n.

In this paper we study random polytopes, either the intersection of random halfspaces or the convex hull of random vectors, chosen from the unit sphere. In the first case, we prove that the diameter is between Omega(m)^{1/(n-1)} and O( (4√2)^n  m^1/(n-1)) with high probability up to logarithmic factors. In the second case, we prove that the diameter is between Omega(m)^{1/(n-1)} and O( (√2)^n  m^1/(n-1)) with high probability up to logarithmic factors.

 

The lecture will be given online. Please visit the website for more information and the zoom link.