Piercing Translates and Homothets of a Convex Body

被引:8
|
作者
Dumitrescu, Adrian [2 ]
Jiang, Minghui [1 ]
机构
[1] Utah State Univ, Dept Comp Sci, Logan, UT 84322 USA
[2] Univ Wisconsin Milwaukee, Dept Comp Sci, Milwaukee, WI 53201 USA
基金
美国国家科学基金会;
关键词
Geometric transversals; Gallai-type problems; Packing and covering; Approximation algorithms; INEQUALITY LINKING PACKING; TIME APPROXIMATION SCHEMES; TRANSVERSAL NUMBERS; COVERING DENSITIES; POINT COVERS; PLANE; SETS;
D O I
10.1007/s00453-010-9410-4
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
According to a classical result of Grunbaum, the transversal number tau(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in a"e (d) is bounded by a function of d. Denote by alpha(C) (resp. beta(C)) the supremum of the ratio of the transversal number tau(F) to the packing number nu(F) over all finite families F of translates (resp. homothets) of a convex body C in a"e (d) . Kim et al. recently showed that alpha(C) is bounded by a function of d for any convex body C in a"e (d) , and gave the first bounds on alpha(C) for convex bodies C in a"e (d) and on beta(C) for convex bodies C in the plane. Here we show that beta(C) is also bounded by a function of d for any convex body C in a"e (d) , and present new or improved bounds on both alpha(C) and beta(C) for various convex bodies C in a"e (d) for all dimensions d. Our techniques explore interesting inequalities linking the covering and packing densities of a convex body. Our methods for obtaining upper bounds are constructive and lead to efficient constant-factor approximation algorithms for finding a minimum-cardinality point set that pierces a set of translates or homothets of a convex body.
引用
收藏
页码:94 / 115
页数:22
相关论文
共 50 条