On rectangular covering problems

DOI10.1142/S0218195909002988MaRDI QIDQ3401889zbMATH OpenFDO

Authors Stefan Porschen

Publication date 1 February 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingexact algorithmoptimization problemclosure operatorrectangular set cover

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Algorithms for Rectangular Covering Problems
• On covering \(\mathbb Z\)-grid points by rectangles
• Computational Science and Its Applications – ICCSA 2004
• Experimental and Efficient Algorithms
• Covering a point set by two disjoint rectangles

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A parallel rendezvous algorithm for interpolation between multiple grids.
• Approximation algorithms for NP-hard problems.
• Finding tailored partitions
• Load Balancing for Adaptive Multigrid Methods
• Minimum-diameter covering problems
• On clustering problems with connected optima in Euclidean spaces
• On the structure of multiple translational tilings by polygonal regions
• Optimal rectangular partitions
• Probing convex polygons with half-planes
• Rectangular Tiling in Multidimensional Arrays
• Vertex cover: Further observations and further improvements

Cited in

(19)

• On a problem about covering lines by squares
• Building a consensus: a rectangle covering problem
• Algorithms for Rectangular Covering Problems
• Weighted geometric set cover with rectangles of bounded integer side lengths
• scientific article; zbMATH DE number 5291457 (Why is no real title available?)
• On bounds for a board covering problem
• Covering a set of points in multidimensional space
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• Lower bounds for covering problems
• The p-cover problem
• A rectangular cover problem
• Finding sets covering a point with application to mesh-free Galerkin methods
• Variable-Size Rectangle Covering
• Computational Science and Its Applications – ICCSA 2004
• Covering a point set by two disjoint rectangles
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• scientific article; zbMATH DE number 5790346 (Why is no real title available?)
• A hybrid heuristic for the rectilinear picture compression problem
• On covering \(\mathbb Z\)-grid points by rectangles

This page was built for publication: On rectangular covering problems

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