On the complexity of computing the diameter of a polytope
From MaRDI portal
Recommendations
Cites work
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Paths on Polytopes
- Polytope pairs and their relationship to linear programming
- The complexity of facets (and some facets of complexity)
- The polynomial-time hierarchy
Cited in
(8)- The complexity of facets (and some facets of complexity)
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- Shortest reconfiguration of perfect matchings via alternating cycles
- Pivot rules for circuit-augmentation algorithms in linear optimization
- On the hardness of short and sign-compatible circuit walks
- Hardness of finding combinatorial shortest paths on graph associahedra
- The hardness of monotone eccentricity on polytopes
This page was built for publication: On the complexity of computing the diameter of a polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337144)