The d-Step Conjecture and Its Relatives
From MaRDI portal
Publication:3769521
DOI10.1287/moor.12.4.718zbMath0632.52007OpenAlexW2033342930WikidataQ123135338 ScholiaQ123135338MaRDI QIDQ3769521
Victor Klee, Peter Kleinschmidt
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.12.4.718
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Polytopes and polyhedra (52Bxx)
Related Items
Diameters of cocircuit graphs of oriented matroids: an update, Spherical complexes and nonprojective toric varieties, Shellability of chessboard complexes, On the complexity of some basic problems in computational convexity. I. Containment problems, Lattice-free polytopes and their diameter, Many triangulated spheres, How to make a triangulation of $S^3$ polytopal, A Minimal Irreducible Triangulation of $$\mathbb{S}^{3}$$, Obstructions to weak decomposability for simplicial polytopes, Criss-cross methods: A fresh view on pivot algorithms, Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable, A quasi-polynomial bound for the diameter\\of graphs of polyhedra, Nonrevisiting paths on surfaces, Non-revisiting paths on surfaces with low genus, Connectivity and \(W_v\)-paths in polyhedral maps on surfaces, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, A generalization of a result of Dong and Santos-Sturmfels on the Alexander dual of spheres and balls, Transportation problems which can be solved by the use of hirsch-paths for the dual problems, Polyhedral graph abstractions and an approach to the linear Hirsch conjecture, On locally constructible spheres and balls, A counterexample to the Hirsch conjecture, On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes, On the diameter of convex polytopes, Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count, An O(\(n\)) bound for the diameter of transshipment polytopes, Upper bounds for the diameter and height of graphs of convex polyhedra, On the circuit diameter conjecture, Paths on polymatroids, The monotonic diameter of the perfect matching and shortest path polytopes, Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets, Signature classes of transportation polytopes, Vertex decomposability of complexes associated to forests, One-point suspensions and wreath products of polytopes and spheres, A construction of SKT manifolds using toric geometry, A refinement of Todd's bound for the diameter of a polyhedron, Equidecomposable and weakly neighborly polytopes, The monotonic diameter of traveling salesman polytopes, The Hirsch conjecture is true for (0,1)-polytopes, The width of five-dimensional prismatoids, The Hirsch Conjecture Holds for Normal Flag Complexes, Adjacency on combinatorial polyhedra, A structure theorem for pseudomanifolds, More polytopes meeting the conjectured Hirsch bound, Pivot rules for linear programming: A survey on recent theoretical developments
