arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.04210cs.CGcs.DS
收藏

失控矩形逃逸问题

The Runaway Rectangle Escape Problem

Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C Nandy, Shreyas Shetty

摘要:

受布线在PCB总线中的应用的启发,矩形逃逸问题最近被引入和研究。在这个问题中,我们在矩形区域$R$中给定一组矩形$\mathcal{S}$,我们想将这些矩形扩展到$R$的四条边之一。将$R$中点$p$的密度定义为包含$p$的扩展矩形的数量。然后,问题是找到具有最小最大密度的扩张。我们考虑的问题,最大限度地提高矩形的数量,可以扩展时,允许的最大密度是最多$d$。已知该问题对于$d = 1$是多项式可解的,并且对于任何$d \geq 2$是NP难的。我们认为近似和精确算法固定值的$d$。我们还表明,这个问题的一个非常特殊的情况下,当所有的矩形是从一个网格的单位正方形,继续是NP难的$d = 2$。

英文摘要:

Motivated by the applications of routing in PCB buses, the Rectangle Escape Problem was recently introduced and studied. In this problem, we are given a set of rectangles $\mathcal{S}$ in a rectangular region $R$, and we would like to extend these rectangles to one of the four sides of $R$. Define the density of a point $p$ in $R$ as the number of extended rectangles that contain $p$. The question is then to find an extension with the smallest maximum density. We consider the problem of maximizing the number of rectangles that can be extended when the maximum density allowed is at most $d$. It is known that this problem is polynomially solvable for $d = 1$, and NP-hard for any $d \geq 2$. We consider approximation and exact algorithms for fixed values of $d$. We also show that a very special case of this problem, when all the rectangles are unit squares from a grid, continues to be NP-hard for $d = 2$.

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

↑