Covering Regions by Rectangles
From MaRDI portal
Publication:4742806
DOI10.1137/0602042zbMath0506.05022OpenAlexW1978186063MaRDI QIDQ4742806
Seth Chaiken, James B. Shearer, Michael E. Saks, Daniel J. Kleitman
Publication date: 1981
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0602042
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items (20)
Covering Regions with Squares ⋮ Algebraic languages and polyominoes enumeration ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ A hybrid heuristic for the rectilinear picture compression problem ⋮ Covering orthogonal polygons with star polygons: The perfect graph approach ⋮ Combinatorial properties of polyominoes ⋮ Unique Coverage with Rectangular Regions ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ A weighted min-max relation for intervals ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Complexities of efficient solutions of rectilinear polygon cover problems ⋮ Attribute grammars are useful for combinatorics ⋮ It’s Hard to Color Antirectangles ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ A Class of Perfect Graphs Associated with Planar Rectilinear Regions ⋮ Enumeration of L-convex polyominoes by rows and columns ⋮ A minimax theorem on intervals ⋮ Covering simply connected regions by rectangles ⋮ Rectangular partition is polynomial in two dimensions but NP-complete in three
Cites Work
This page was built for publication: Covering Regions by Rectangles
