Extended Formulations for Polygons

The extension complexity of a polytope P is the smallest integer k such that P is the projection of a polytope Q with k facets. We study the extension complexity of n-gons in the plane. First, we give a new proof that the extension complexity of regular n-gons is O(log n), a result originating from...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs: Fiorini, Samuel, Tiwary, Hans Raj, Rothvoss, Thomas
Andere auteurs: Massachusetts Institute of Technology. Department of Mathematics
Formaat: Artikel
Taal:English
Gepubliceerd in: Springer-Verlag 2017
Online toegang:http://hdl.handle.net/1721.1/107947

Gelijkaardige items