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...
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
-
Some 0/1 polytopes need exponential size extended formulations
door: Rothvoss, Thomas
Gepubliceerd in: (2016) -
Circumscribing Polygons and Polygonizations for Disjoint Line Segments
door: Akitaya, Hugo A., et al.
Gepubliceerd in: (2022) -
POLYGONS AND GRAVITONS
door: Hitchin, N
Gepubliceerd in: (1979) -
On k-convex polygons
door: Aichholzer, Oswin, et al.
Gepubliceerd in: (2014) -
Minimality and mutation-equivalence of polygons
door: Prince, T, et al.
Gepubliceerd in: (2017)