An NP-hard problem is considered of intersecting a given set of $n$ straight line segments on the plane with the smallest cardinality set of disks of fixed radii $r>0,$ where the set of segments forms a straight line drawing $G=(V,E)$ of a planar graph without proper edge crossings. To the best of our knowledge, related work only tackles a setting where $E$ consists of (generally, properly overlapping) axis-parallel segments, resulting in an $O(n\log n)$-time and $O(n\log n)$-space 8-approximation algorithm. Exploiting tough connection of the problem with the geometric Hitting Set problem, an $\left(50+52\sqrt{\frac{12}{13}}+ν\right)$-approximate $O\left(n^4\log n\right)$-time and $O\left(n^2\log n\right)$-space algorithm is devised based on the modified Agarwal-Pan algorithm, which uses epsilon nets. More accurate $(34+24\sqrt{2}+ν)$- and $\left(\frac{144}{5}+32\sqrt{\frac{3}{5}}+ν\right)$-approxi\-mate algorithms are also proposed for cases where $G$ is any subgraph of either a generalized outerplane graph or a Delaunay triangulation respectively, which work within the same time and space complexity bounds, where $ν>0$ is an arbitrarily small constant.
Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
ETH Zürich(苏黎世联邦理工学院);TU Munich(慕尼黑工业大学);University of Tübingen(蒂宾根大学);Universitat Politècnica de Catalunya(加泰罗尼亚理工大学);University of Basel(巴塞尔大学);TU Graz(格拉茨工业大学)
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems
在矩形刺伤问题中,我们在$\RR^2$中给定一个轴对齐矩形的集合$\cR$,目标是找到一个水平和/或垂直线的最小基数集合,使得每个矩形被这些线中的一条包围。已知该问题的标准LP松弛具有2的积分间隙,而更好的积分间隙为1.58。当$\cR$是一组水平段时的特殊情况是已知的。在本文中,我们考虑两个更特殊的情况:当$\cR$是一组水平和垂直段,当$\cR$是一组单位正方形。我们表明,在这两种情况下的标准LP松弛的完整性差距是严格小于$2$。我们的舍入技术基于Kovaleva和Spieksma(SIAM J. Disc. Math 2006),这可能证明对舍入其他几何覆盖问题的LP松弛有用。
我们考虑下面的几何优化问题:给定平面中的$ n $轴对齐矩形,目标是找到一组总长度最小的水平段,使得每个矩形都是刺的。如果线段与矩形的左边缘和右边缘都相交,则线段插入矩形。因此,这个刺伤问题属于加权几何集覆盖问题的技术,提高了一般的$Θ(\log n)$近似保证的类别,在文献中得到了很多关注。Chan等人(2018)已经证明矩形刺入是NP难的,并且它允许基于Varadarajan准均匀采样方法的常数因子近似算法。在这项工作中,我们在两个方面取得了进展矩形刺。首先,我们提出了一个准多项式时间近似方案(QPTAS)的矩形刺。此外,我们提供了一个简单的$8$ -近似算法,避免了Varadarajan的框架。这解决了Chan et al.(2018)提出的两个悬而未决的问题。