Covering Regions by Rectangles

DOI10.1137/0602042MaRDI QIDQ4742806zbMATH OpenOpenAlexFDO

Authors Seth Chaiken, James B. Shearer, Daniel J. Kleitman, Michael Saks

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

zbMATH Keywords

antirectanglerectangle covers of lattice squares

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Cited in

(20)

• Complexities of efficient solutions of rectilinear polygon cover problems
• A minimax theorem on intervals
• Jump number of two-directional orthogonal ray graphs
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• A hybrid heuristic for the rectilinear picture compression problem
• It’s Hard to Color Antirectangles
• Algebraic languages and polyominoes enumeration
• Combinatorial properties of polyominoes
• Covering Regions with Squares
• 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
• Attribute grammars are useful for combinatorics
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Unique coverage with rectangular regions
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
• A weighted min-max relation for intervals
• Covering simply connected regions by rectangles
• Rectangular partition is polynomial in two dimensions but NP-complete in three

This page was built for publication: Covering Regions by Rectangles

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