Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

DOI10.1007/s11750-013-0292-xzbMath1311.52011MaRDI QIDQ5965566

Friedrich Eisenbrand

Publication date: 28 November 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-013-0292-x

Mathematics Subject Classification ID

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

90C60: Abstract computational complexity for mathematical programming problems

90C05: Linear programming

05E45: Combinatorial aspects of simplicial complexes

Related Items

Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count

Cites Work

• A counterexample to the Hirsch conjecture
• A linear bound on the diameter of the transportation polytope
• Graphs of transportation polytopes
• An upper bound for the diameter of a polytope
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
• The Hirsch conjecture is true for (0,1)-polytopes
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Diameter of Polyhedra: Limits of Abstraction
• The Hirsch Conjecture for Dual Transportation Polyhedra
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• Paths on Polytopes
• On sub-determinants and the diameter of polyhedra