ON RECTANGULAR COVERING PROBLEMS

DOI10.1142/S0218195909002988zbMath1185.65038MaRDI QIDQ3401889

Stefan Porschen

Publication date: 1 February 2010

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

zbMATH Keywords

dynamic programmingclosure operatoroptimization problemexact algorithmrectangular 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

• On clustering problems with connected optima in Euclidean spaces
• A parallel rendezvous algorithm for interpolation between multiple grids.
• On the structure of multiple translational tilings by polygonal regions
• Vertex Cover: Further Observations and Further Improvements
• Finding tailored partitions
• Probing convex polygons with half-planes
• Load Balancing for Adaptive Multigrid Methods
• Minimum-diameter covering problems
• Rectangular Tiling in Multidimensional Arrays
• Optimal rectangular partitions
• Unnamed Item
• Unnamed Item

This page was built for publication: ON RECTANGULAR COVERING PROBLEMS