Events by date

Title: Rectangle covers and bounding the extension complexity of the correlation polytope

Title: Steiner Cut Dominants

Abstract: For a subset of terminals T of the nodes of a graph G a cut in G is called a T-Steiner cut if it subdivides T into two non-empty sets. The Steiner cut dominant of G is the Minkowski sum of the convex hull of the incidence vectors of T-Steiner cuts in G and the nonnegative orthant.