双松鼠问题及其相关问题
The Two-Squirrel Problem and Its Relatives
摘要:
在本文中,我们从一个称为双松鼠问题的恒星覆盖问题的变化。给定平面中$2n$点的集合$P$以及两个位点$c_1$和$c_2$,计算分别以$c_1$和$c_2$为中心的两个$n$ -星$S_1$和$S_2$,使得$S_1$和$S_2$的最大权重最小化。该问题是强NP-困难的,通过将该问题转化为带参数的集合划分问题。然后,我们考虑两个变化的双松鼠问题,即两个MST和两个TSP问题,这两个问题都是NP-困难的。后者的NP-困难性是明显的,而前者需要一个非平凡的约简,从一个大小的集合划分与矩阵。在近似算法方面,对Two-MST和Two-TSP分别给出了因子3.6402和$4+\varepsilon$的近似。最后,我们还展示了一些有趣的多项式时间可解的情况下,两个MST。
英文摘要:
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set $P$ of $2n$ points in the plane, and two sites $c_1$ and $c_2$, compute two $n$-stars $S_1$ and $S_2$ centered at $c_1$ and $c_2$ respectively such that the maximum weight of $S_1$ and $S_2$ is minimized. This problem is strongly NP-hard by a reduction from Equal-size Set-Partition with Rationals. Then we consider two variations of the Two-Squirrel problem, namely the Two-MST and Two-TSP problem, which are both NP-hard. The NP-hardness for the latter is obvious while the former needs a non-trivial reduction from Equal-size Set-Partition with Rationals. In terms of approximation algorithms, for Two-MST and Two-TSP we give factor 3.6402 and $4+\varepsilon$ approximations respectively. Finally, we also show some interesting polynomial-time solvable cases for Two-MST.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。