Pages that link to "Item:Q5246095"
From MaRDI portal
The following pages link to An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron (Q5246095):
Displaying 17 items.
- Primitive zonotopes (Q724942) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- Hirsch polytopes with exponentially long combinatorial segments (Q1675265) (← links)
- Improved bounds on the diameter of lattice polytopes (Q1747971) (← links)
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
- A refinement of Todd's bound for the diameter of a polyhedron (Q1785425) (← links)
- Distance between vertices of lattice polytopes (Q2174873) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- A note on the diameter of convex polytope (Q2217504) (← links)
- An asymptotically improved upper bound on the diameter of polyhedra (Q2324633) (← links)
- Improving bounds on the diameter of a polyhedron in high dimensions (Q2359957) (← links)
- The diameter of lattice zonotopes (Q5113413) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
