arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.08341cs.CG
收藏

等圆盘刺入线段的高效常因子近似算法

Efficient constant factor approximation algorithms for stabbing line segments with equal disks

Konstantin Kobylkin

摘要:

考虑了平面上给定的$n$直线段集与固定半径圆盘的最小基数集$r>0,$相交的NP-难问题,其中这组线段构成平面图的一个没有适当边交叉的直线图$G=(V,E)$.据我们所知,相关的工作只处理$E$由(通常,适当重叠)轴平行段,从而在$O(n\log n)$ -时间和$O(n\log n)$ -空间8-近似算法的设置。利用该问题与几何Hitting Set问题之间的紧密联系,在改进的Agarwal-Pan算法的基础上,设计了一种基于Petri网的$\left(50+52\sqrt{\frac{12}{13}}+ν\right)$ -近似$O\left(n^4\log n\right)$ -时间和$O\left(n^2\log n\right)$ -空间算法.更精确的$(34+24\sqrt{2}+ν)$ -和$\left(\frac{144}{5}+32\sqrt{\frac{3}{5}}+ν\right)$ -近似算法也被提出的情况下,$G$是一个广义外平面图或Delaunay三角剖分,工作在相同的时间和空间复杂度的界限,其中$ν>0$是一个任意小的常数。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑