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

$R^{4}$中最小链环直线覆盖图是NP难的

Minimum-Link Rectilinear Covering Tour is NP-hard in $R^{4}$

Bhadrachalam Chitturi, Jayakumar Pai

摘要:

给定$R^{d}$中的$n$点的集合$P$,巡回是覆盖所有给定点的闭合简单路径,即哈密尔顿循环。%在$P$中,如果没有三个点共线,则称这些点处于一般位置。\textit{link}是连接两点的线段,直线链接平行于其中一个轴。在$R^2$中,定义一条最小链路数的路径和一个最小链路数的环,分别称为最小链路覆盖路径和最小链路覆盖环,证明了这两个问题是NP难的.在$R^2$中,相应的直线形式也是NP难的。如果没有两个点共享任何坐标,则称一组点在\textit{general position}中。如果没有三个点共享任何坐标,并且任何两个点最多可以共享一个坐标,则我们称$R^{d}$中的一组点为\textit{relaxed general position}中的点。也就是说,如果点处于一般位置或处于松弛的一般位置,则轴平行线最多可以包含一个点。如果点处于松弛的一般位置,则这些问题在$R^{10}$中是NP难的。我们证明了这两个问题在$R^{4}$中实际上是NP困难的。如果点在$R^{d},~d>1$一般的位置,然后这些问题的时间复杂性,基本和直线的版本,是未知的。

英文摘要:

Given a set $P$ of $n$ points in $R^{d}$, a tour is a closed simple path that covers all the given points, i.e. a Hamiltonian cycle. % In $P$ if no three points are collinear then the points are said to be in general position. A \textit{link} is a line segment connecting two points and a rectilinear link is parallel to one of the axes. The problems of defining a path and a tour with minimum number of links, also known as Minimum-Link Covering Path and Minimum-Link Covering Tour respectively are proven to be NP-hard in $R^2$. The corresponding rectilinear versions are also NP-hard in $R^2$. A set of points is said to be in \textit{general position} for rectilinear versions of the problems if no two points share any coordinate. We call a set of points in $R^{d}$ to be in \textit{relaxed general position} if no three points share any coordinate and any two points can share at most one coordinate. That is, if the points are either in general position or in relaxed general position then an axis parallel line can contain at most one point. If points are in relaxed general position then these problems are NP-hard in $R^{10}$. We prove that these two problems are in fact NP-hard in $R^{4}$. If points in $R^{d},~d>1$ are in general position then the time complexities of these problems, both basic and rectilinear versions, are unknown.

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

↑