Rock extensions with linear diameters
From MaRDI portal
Publication:6654117
DOI10.1137/23M1585878MaRDI QIDQ6654117
Volker Kaibel, Kirill Kukharenko
Publication date: 18 December 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Linear programming (90C05) Convex functions and convex programs in convex geometry (52A41) Polytopes and polyhedra (52Bxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A counterexample to the Hirsch conjecture
- On the shadow simplex method for curved polyhedra
- Simple extensions of polytopes
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The four-colour theorem
- Mathematical problems for the next century
- An asymptotically improved upper bound on the diameter of polyhedra
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- The width of five-dimensional prismatoids
- An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
- On sub-determinants and the diameter of polyhedra
- Algorithms in real algebraic geometry
- Complexity, exactness, and rationality in polynomial optimization
This page was built for publication: Rock extensions with linear diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654117)
