On some polyhedra covering problems

DOI10.1023/A:1009833410742zbMATH Open1028.90088OpenAlexW1599901748MaRDI QIDQ1592841FDOQ1592841

Authors: Cao An Wang, Boting Yang, Binhai Zhu 

Publication date: 25 January 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009833410742

Recommendations

• On a set of problems on covering of a bounded set
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Algorithms for polytope covering and approximation
• Covering Polygons Is Hard
• scientific article; zbMATH DE number 4030363

zbMATH Keywords

computational geometryNP-hardpolyhedra covering

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cited In (11)

• Formalization and solution of one class of covering problems for the design of monitoring and testing systems
• Translating a convex polyhedron over monotone polyhedra
• On a set of problems on covering of a bounded set
• Covering a simplex by spheres: complexity and algorithms
• Multiple coverings with closed polygons
• Classification of convex polyhedra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New analysis of the sphere covering problems and optimal polytope approximation of convex bodies
• Containment problems for polytopes and spectrahedra

This page was built for publication: On some polyhedra covering problems

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