用于对中矩形的QPTAS
A QPTAS for stabbing rectangles
摘要:
我们考虑下面的几何优化问题:给定平面中的$ n $轴对齐矩形,目标是找到一组总长度最小的水平段,使得每个矩形都是刺的。如果线段与矩形的左边缘和右边缘都相交,则线段插入矩形。因此,这个刺伤问题属于加权几何集覆盖问题的技术,提高了一般的$Θ(\log n)$近似保证的类别,在文献中得到了很多关注。Chan等人(2018)已经证明矩形刺入是NP难的,并且它允许基于Varadarajan准均匀采样方法的常数因子近似算法。在这项工作中,我们在两个方面取得了进展矩形刺。首先,我们提出了一个准多项式时间近似方案(QPTAS)的矩形刺。此外,我们提供了一个简单的$8$ -近似算法,避免了Varadarajan的框架。这解决了Chan et al.(2018)提出的两个悬而未决的问题。
英文摘要:
We consider the following geometric optimization problem: Given $ n $ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length such that each rectangle is stabbed. A segment stabs a rectangle if it intersects both its left and right edge. As such, this stabbing problem falls into the category of weighted geometric set cover problems for which techniques that improve upon the general $Θ(\log n)$-approximation guarantee have received a lot of attention in the literature. Chan at al. (2018) have shown that rectangle stabbing is NP-hard and that it admits a constant-factor approximation algorithm based on Varadarajan's quasi-uniform sampling method. In this work we make progress on rectangle stabbing on two fronts. First, we present a quasi-polynomial time approximation scheme (QPTAS) for rectangle stabbing. Furthermore, we provide a simple $8$-approximation algorithm that avoids the framework of Varadarajan. This settles two open problems raised by Chan et al. (2018).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。