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

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

Cited in

(21)

• Covering simply connected regions by rectangles
• Combinatorial properties of polyominoes
• A weighted min-max relation for intervals
• Attribute grammars are useful for combinatorics
• Algebraic languages and polyominoes enumeration
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• Independent sets and hitting sets of bicolored rectangular families
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
• Enumeration of L-convex polyominoes by rows and columns
• Jump number of two-directional orthogonal ray graphs
• It’s Hard to Color Antirectangles
• Covering Regions with Squares
• Unique coverage with rectangular regions
• A Class of Perfect Graphs Associated with Planar Rectilinear Regions
• A hybrid heuristic for the rectilinear picture compression problem
• Complexities of efficient solutions of rectilinear polygon cover problems
• Covering simple orthogonal polygons with rectangles
• Packing resizable items with application to video delivery over wireless networks
• A minimax theorem on intervals
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Covering orthogonal polygons with star polygons: The perfect graph approach

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)