Pages that link to "Item:Q1212692"

The following pages link to An upper bound for the diameter of a polytope (Q1212692):

Displaying 17 items.

• Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
• A counterexample to the Hirsch conjecture (Q447933) (← links)
• On the shadow simplex method for curved polyhedra (Q728496) (← links)
• Polytopes and arrangements: diameter and curvature (Q935228) (← links)
• Hirsch polytopes with exponentially long combinatorial segments (Q1675265) (← links)
• Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
• On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes (Q1753029) (← links)
• Distance between vertices of lattice polytopes (Q2174873) (← links)
• Improving bounds on the diameter of a polyhedron in high dimensions (Q2359957) (← links)
• Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable (Q2925352) (← links)
• Obstructions to weak decomposability for simplicial polytopes (Q3190213) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• The width of five-dimensional prismatoids (Q5245200) (← links)
• The Hirsch Conjecture Holds for Normal Flag Complexes (Q5247624) (← links)
• On sub-determinants and the diameter of polyhedra (Q5891422) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965566) (← links)
• A spectral approach to polytope diameter (Q6642303) (← links)