Pages that link to "Item:Q527446"

The following pages link to Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446):

Displaying 7 items.

• Fooling sets and the spanning tree polytope (Q1705643) (← links)
• Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
• The facets of the spanning trees polytope (Q2168051) (← 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)
• A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)
• Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)