arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.03992cs.DMcs.DSmath.CO
收藏

接近$s$ - $t$ -路径TSP的$\frac{3}{2}$

Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP

Vera Traub, Jens Vygen

摘要:

我们表明,有一个多项式时间算法的近似保证$\frac{3}{2}+ε$的$s$ - $t$ -路径TSP,任何固定的$ε>0$。众所周知,Wolsey对Christofides算法的分析也适用于$s$ - $t$ -路径TSP,其自然LP松弛除了窄割(其中LP解具有小于2的值)。一个固定的最优路径要么在一个狭窄的切割中有一条边(然后称该边和该切割为孤独的),要么至少有三条边(然后称该切割为忙碌的)。我们的算法“猜测”(动态规划)孤独的削减和边缘。然后,我们将实例划分为更小的实例并加强LP,要求值至少为3用于繁忙切割。通过建立一个$k$级递归动态程序,我们可以计算生成树$(V,S)$和LP解$y$,使得$(\frac{1}{2}+O(2^{-k}))y$在$T$ -连接多面体中,其中$T$是$S$中度具有错误奇偶性的顶点的集合.

英文摘要:

We show that there is a polynomial-time algorithm with approximation guarantee $\frac{3}{2}+ε$ for the $s$-$t$-path TSP, for any fixed $ε>0$. It is well known that Wolsey's analysis of Christofides' algorithm also works for the $s$-$t$-path TSP with its natural LP relaxation except for the narrow cuts (in which the LP solution has value less than two). A fixed optimum tour has either a single edge in a narrow cut (then call the edge and the cut lonely) or at least three (then call the cut busy). Our algorithm "guesses" (by dynamic programming) lonely cuts and edges. Then we partition the instance into smaller instances and strengthen the LP, requiring value at least three for busy cuts. By setting up a $k$-stage recursive dynamic program, we can compute a spanning tree $(V,S)$ and an LP solution $y$ such that $(\frac{1}{2}+O(2^{-k}))y$ is in the $T$-join polyhedron, where $T$ is the set of vertices whose degree in $S$ has the wrong parity.

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

↑