On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope (Q6282824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope |
scientific article |
Statements
5 February 2017
0 references
cs.DM
0 references
math.OC
0 references
