arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.02839math.COcs.CGcs.DM
收藏

关于单位立方体中点的旅行商问题

On a Traveling Salesman Problem for Points in the Unit Cube

József Balogh, Felix Christian Clemen, Adrian Dumitrescu

AI总结:

本文研究单位立方体中点集的 $k$ 次幂长度旅行商常数,构造性地将 Bollobás–Meir 上界改进至约 $2.91\sqrt{k}$,并证明 $c_3\geq 2^{7/6}$,否定其三维猜想。

摘要:

设 $X$ 是 $k$ 维单位立方体 $[0,1]^k$ 中的一个含 $n$ 个元素的点集,其中 $k \geq 2$。根据 Bollobás 和 Meir(1992)的一个旧结果,存在一条经过这 $n$ 个点的环(旅行)$x_1,x_2,\ldots,x_n$,使得 $\left(\sum_{i=1}^n |x_i-x_{i+1}|^k\right)^{1/k}\leq c_k$,其中 $|x-y|$ 是 $x$ 与 $y$ 之间的欧氏距离,$c_k$ 是仅依赖于 $k$ 的绝对常数,且 $x_{n+1}\equiv x_1$。另一方面,对于每个 $k\geq 2$ 和 $n\geq 2$,$[0,1]^k$ 中都存在 $n$ 个点,使其最短旅行满足 $\left(\sum_{i=1}^n |x_i-x_{i+1}|^k\right)^{1/k}=2^{1/k}\cdot\sqrt{k}$。对于平面,最佳常数是 $c_2=2$,这也是唯一已知的确切值。Bollobás 和 Meir 证明,对于每个 $k\geq 3$,可以取 $c_k=9\left(\frac23\right)^{1/k}\cdot\sqrt{k}$,并猜想对于每个 $k\geq 2$,最佳常数为 $c_k=2^{1/k}\cdot\sqrt{k}$。本文显著改进了上界,并证明可以取 $c_k=3\sqrt5\left(\frac23\right)^{1/k}\cdot\sqrt{k}$,或 $c_k=2.91\sqrt{k}\\,(1+o_k(1))$。我们的界是构造性的。我们还证明了 $c_3\geq 2^{7/6}$,从而否定了 $k=3$ 时的猜想。在此背景下,文中讨论了与匹配问题、功率分配问题以及相关问题(包括算法)的联系,并提出了一个略作修订的 Bollobás–Meir 猜想版本。

英文摘要:

Let $X$ be an $n$-element point set in the $k$-dimensional unit cube $[0,1]^k$ where $k \geq 2$. According to an old result of Bollobás and Meir (1992), there exists a cycle (tour) $x_1, x_2, \ldots, x_n$ through the $n$ points, such that $\left(\sum_{i=1}^n |x_i - x_{i+1}|^k \right)^{1/k} \leq c_k$, where $|x-y|$ is the Euclidean distance between $x$ and $y$, and $c_k$ is an absolute constant that depends only on $k$, where $x_{n+1} \equiv x_1$. From the other direction, for every $k \geq 2$ and $n \geq 2$, there exist $n$ points in $[0,1]^k$, such that their shortest tour satisfies $\left(\sum_{i=1}^n |x_i - x_{i+1}|^k \right)^{1/k} = 2^{1/k} \cdot \sqrt{k}$. For the plane, the best constant is $c_2=2$ and this is the only exact value known. Bollob{á}s and Meir showed that one can take $c_k = 9 \left(\frac23 \right)^{1/k} \cdot \sqrt{k}$ for every $k \geq 3$ and conjectured that the best constant is $c_k = 2^{1/k} \cdot \sqrt{k}$, for every $k \geq 2$. Here we significantly improve the upper bound and show that one can take $c_k = 3 \sqrt5 \left(\frac23 \right)^{1/k} \cdot \sqrt{k}$ or $c_k = 2.91 \sqrt{k} \ (1+o_k(1))$. Our bounds are constructive. We also show that $c_3 \geq 2^{7/6}$, which disproves the conjecture for $k=3$. Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás--Meir conjecture is proposed.

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

↑