On rectangular covering problems

DOI10.1142/S0218195909002988zbMATH Open1185.65038MaRDI QIDQ3401889FDOQ3401889

Authors: Stefan Porschen 

Publication date: 1 February 2010

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

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

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)

Cites Work

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

Cited In (19)

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