The following pages link to An update on the Hirsch conjecture (Q613104):
Displaying 19 items.
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Edges versus circuits: a hierarchy of diameters in polyhedra (Q1707378) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- Cyclic polytopes, oriented matroids and intersections of quadrics (Q2398324) (← links)
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture (Q2436640) (← links)
- (Q2857397) (← links)
- Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable (Q2925352) (← links)
- Obstructions to weak decomposability for simplicial polytopes (Q3190213) (← links)
- What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- The width of five-dimensional prismatoids (Q5245200) (← links)
- More bounds on the diameters of convex polytopes (Q5299904) (← links)
- On sub-determinants and the diameter of polyhedra (Q5891422) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
