On the number of corner cuts

DOI10.1016/S0196-8858(02)00014-3zbMath1016.52004MaRDI QIDQ1865258

Uli Wagner

Publication date: 26 March 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-setGröbner fanreverse searchcorner cut

Mathematics Subject Classification ID

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) Enumerative combinatorics (05A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Cutting corners with spheres in \(d\)-dimensions ⋮ Minimal average degree aberration and the state polytope for experimental designs ⋮ Betti numbers of polynomial hierarchical models for experimental designs ⋮ The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. ⋮ Cutting Corners by Circles and Spheres

Cites Work

• Unnamed Item
• Halving point sets
• Cutting dense point sets in half
• The number of plane corner cuts
• A Polynomial Time Algorithm for Shaped Partition Problems
• Cutting corners
• Point sets with many \(k\)-sets
• An improved bound for \(k\)-sets in three dimensions

This page was built for publication: On the number of corner cuts