Rectangle covers revisited computationally

DOI10.1007/11427186_7MaRDI QIDQ5710072zbMATH OpenOpenAlexFDO

Authors Laura Heinrich-Litan, Marco E. Lübbecke

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461, https://depositonce.tu-berlin.de/handle/11303/15519

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 5291457
• Close approximations of minimum rectangular coverings
• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• Complexities of efficient solutions of rectilinear polygon cover problems
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles

Cited in

(16)

• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• The 2D subarray polytope
• A rectangular cover problem
• Covering polygons with rectangles
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• Effect of corner information in simultaneous placement of k rectangles and tableaux
• On rectangular covering problems
• scientific article; zbMATH DE number 5291457 (Why is no real title available?)
• Minimum vertex cover in rectangle graphs
• Variable-Size Rectangle Covering
• scientific article; zbMATH DE number 776079 (Why is no real title available?)
• Covering with rectangular pieces
• Covering a polygonal region by rectangles
• Minimum vertex cover in rectangle graphs
• A hybrid heuristic for the rectilinear picture compression problem
• Covering rectilinear polygons with area-weighted rectangles

This page was built for publication: Rectangle covers revisited computationally

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