Enumerative combinatorics (05A99) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
Cites work
- A Polynomial Time Algorithm for Shaped Partition Problems
- An improved bound for \(k\)-sets in three dimensions
- Cutting corners
- Cutting dense point sets in half
- Halving point sets
- scientific article; zbMATH DE number 2185596 (Why is no real title available?)
- Point sets with many \(k\)-sets
- The number of plane corner cuts
Cited in
(12)- Corner cuts and their polytopes
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.
- The number of plane corner cuts
- Cutting corners with spheres in \(d\)-dimensions
- Betti numbers of polynomial hierarchical models for experimental designs
- Corner cutting systems
- Minimal average degree aberration and the state polytope for experimental designs
- Cutting Corners by Circles and Spheres
- On the number of shredders
- Approximation of corner polyhedra with families of intersection cuts
- Cutting corners
- Triangular partitions: enumeration, structure, and generation
This page was built for publication: On the number of corner cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865258)
