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

线段覆盖胞腔的逼近性

Approximability of Covering Cells with Line Segments

Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira

摘要:

在COCOA 2015中,Korman等人研究了以下几何覆盖问题:给定平面中的$n$线段的集合$S$,找到最小数量的线段,使得线段排列中的每个单元都被覆盖。这里,如果$s$与$f$关联,则线段$s$覆盖小区$f$。即使$S$中的线段是轴平行的,该问题也被证明是NP难的,并且当目标是覆盖“矩形”单元(即,由恰好四个轴平行的线段限定的单元)。在本文中,我们考虑问题的可逼近性。首先给出了当$S$中的线段在任意方向上时的PTAS,但我们只能从一个方向上选择覆盖线段。然后,我们表明,当目标是覆盖矩形单元格使用线段从水平和垂直线段,那么问题是APX困难的。我们还考虑了问题的参数化的复杂性,并证明了问题是FPT参数化时的最优解的大小。当$S$中的线段有两个方向并且目标是覆盖所有细胞时,我们的FPT算法起作用,补充了Korman等人的目标是覆盖“矩形”细胞。

英文摘要:

In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set $S$ of $n$ line segments in the plane, find a minimum number of line segments such that every cell in the arrangement of the line segments is covered. Here, a line segment $s$ covers a cell $f$ if $s$ is incident to $f$. The problem was shown to be NP-hard, even if the line segments in $S$ are axis-parallel, and it remains NP-hard when the goal is cover the "rectangular" cells (i.e., cells that are defined by exactly four axis-parallel line segments). In this paper, we consider the approximability of the problem. We first give a PTAS for the problem when the line segments in $S$ are in any orientation, but we can only select the covering line segments from one orientation. Then, we show that when the goal is to cover the rectangular cells using line segments from both horizontal and vertical line segments, then the problem is APX-hard. We also consider the parameterized complexity of the problem and prove that the problem is FPT when parameterized by the size of an optimal solution. Our FPT algorithm works when the line segments in $S$ have two orientations and the goal is to cover all cells, complementing that of Korman et al. in which the goal is to cover the "rectangular" cells.

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

↑