Variable-Size Rectangle Covering

DOI10.1007/978-3-642-02026-1_13MaRDI QIDQ3637061zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10722/61165

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25) Communication networks in operations research (90B18)

Recommendations

• Unique coverage with rectangular regions
• Covering a point set by two disjoint rectangles
• On rectangular covering problems
• Unit disk cover problem in 2D
• Experimental and Efficient Algorithms

Cited in

(6)

• Online variable sized covering
• Online clustering with variable sized clusters
• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
• Unique coverage with rectangular regions
• Minimum membership covering and hitting
• Generalized class cover problem with axis-parallel strips

This page was built for publication: Variable-Size Rectangle Covering

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