Point containment in the integer hull of a polyhedron

MaRDI QIDQ5501355zbMATH OpenFDO

Authors Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, K. Mehlhorn

Publication date 3 August 2015

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• On integer points in polyhedra
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Computing Two-Dimensional Integer Hulls
• Computing the integer points of a polyhedron. I: Algorithm
• Computing the integer points of a polyhedron. II: Complexity estimates

Cited in

(9)

• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• Mapping multiple regions to the grid with bounded Hausdorff distance
• The convex hull of the integer points in a large ball
• Polytope Containment and Determination by Linear Probes
• On the co-NP-completeness of the zonotope containment problem
• On the complexity of four polyhedral set containment problems
• Computing the integer points of a polyhedron. II: Complexity estimates
• scientific article; zbMATH DE number 4053349 (Why is no real title available?)
• On integer points in polyhedra

This page was built for publication: Point containment in the integer hull of a polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501355)