Recent results around the diameter of polyhedra
From MaRDI portal
Publication:4589031
zbMATH Open1373.52014MaRDI QIDQ4589031FDOQ4589031
Authors: Friedrich Eisenbrand
Publication date: 6 November 2017
Recommendations
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- More bounds on the diameters of convex polytopes
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Diameter of polyhedra: limits of abstraction
Cited In (17)
- The width of five-dimensional prismatoids
- On the diameter of lattice polytopes
- More bounds on the diameters of convex polytopes
- Diameter of polyhedra: limits of abstraction
- Diameter of polyhedra: limits of abstraction
- Edge-graph diameter bounds for convex polytopes with few facets
- Polytopes and arrangements: diameter and curvature
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- A note on the diameter of convex polytope
- A spectral approach to polytope diameter
- On the complexity of computing the diameter of a polytope
- Improving bounds on the diameter of a polyhedron in high dimensions
- Lattice-free polytopes and their diameter
- Title not available (Why is that?)
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
This page was built for publication: Recent results around the diameter of polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589031)