scholarly journals Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs

2017 ◽  
Vol 57 (3) ◽  
pp. 757-761 ◽  
Author(s):  
Samuel Fiorini ◽  
Tony Huynh ◽  
Gwenaël Joret ◽  
Kanstantsin Pashkovich
Keyword(s):  
Spanning Tree ◽  
Extended Formulations

scholarly journals Regular Matroids Have Polynomial Extension Complexity

2021 ◽  
Author(s):  
Manuel Aprile ◽  
Samuel Fiorini
Keyword(s):  
Spanning Tree ◽  
Extended Formulations ◽  
Polynomial Extension ◽  
Regular Matroid ◽  
Extension Complexity ◽  
Special Case

We prove that the extension complexity of the independence polytope of every regular matroid on [Formula: see text] elements is [Formula: see text]. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a [Formula: see text] bound for the special case of (co)graphic matroids. However, the case of a general regular matroid was open, despite recent attempts. We also consider the extension complexity of circuit dominants of regular matroids, for which we give a [Formula: see text] bound.

Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure

2009 ◽  
Vol E92-B (3) ◽  
pp. 909-921
Author(s):  
Depeng JIN ◽  
Wentao CHEN ◽  
Li SU ◽  
Yong LI ◽  
Lieguang ZENG
Keyword(s):  
Spanning Tree ◽  
Recovery Scheme
Sign in / Sign up

Export Citation Format

Share Document