On the combinatorial complexity of approximating polytopes
From MaRDI portal
Publication:3132844
Recommendations
Cited in
(14)- Optimal volume-sensitive bounds for polytope approximation
- On affine reducibility of combinatorial polytopes
- Optimal area-sensitive bounds for polytope approximation
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- On the combinatorial complexity of approximating polytopes
- On the polytope faces of the graph approximation problem
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
- Economical Delone sets for approximating convex bodies
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- On the complexity of polytope isomorphism problems
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Oracle-polynomial-time approximation of largest simplices in convex bodies
- scientific article; zbMATH DE number 5598224 (Why is no real title available?)
This page was built for publication: On the combinatorial complexity of approximating polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132844)