Pages that link to "Item:Q2417165"

The following pages link to On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165):

Displaying 8 items.

• On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
• On the extension complexity of combinatorial polytopes (Q745682) (← links)
• Transforming spanning trees: A lower bound (Q1028225) (← links)
• Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
• Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
• Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
• Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)
• On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope (Q6282824) (← links)