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

关于度量s-t路旅行商问题

On the metric s-t path Traveling Salesman Problem

Zhihan Gao

摘要:

研究了度量$s$ - $t$路径旅行商问题(TSP). [An Kleinberg和Shmoys,STOC 2012]对长期存在的$\frac{5}{3}$近似因子进行了改进,并提出了一种实现近似因子$\frac{1+\sqrt{5}}{2}\approx1.61803$的算法。后来[SebIgn,IPCO 2013]进一步将近似因子改进为$\frac{8}{5}$。我们提出了一个简单的,独立的分析,统一了这两个结果,我们的主要贡献是一个\emph{unified correction vector}。我们比较了两种不同的线性规划(LP)松弛的$s$ - $t$路径TSP,即路径版本的Held-Karp LP松弛TSP和较弱的LP松弛,我们表明,这两个LP具有相同的(分数)最优值。此外,我们还证明了两个LP的积分解的最小成本在彼此的$\frac{3}{2}$的一个因子内。我们证明了代价$c$的较强LP松弛的半整数解可以四舍五入为代价至多为$\frac{3}{2}c$的整数解。此外,我们给出了一个坏的例子,提出了两个明显的方法,旨在$\frac{3}{2}$的近似因子的障碍。

英文摘要:

We study the metric $s$-$t$ path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing $\frac{5}{3}$-approximation factor and presented an algorithm that achieves an approximation factor of $\frac{1+\sqrt{5}}{2}\approx1.61803$. Later [Sebő, IPCO 2013] further improved the approximation factor to $\frac{8}{5}$. We present a simple, self-contained analysis that unifies both results; our main contribution is a \emph{unified correction vector}. We compare two different linear programming (LP) relaxations of the $s$-$t$ path TSP, namely, the path version of the Held-Karp LP relaxation for TSP and a weaker LP relaxation, and we show that both LPs have the same (fractional) optimal value. Also, we show that the minimum-cost of integral solutions of the two LPs are within a factor of $\frac{3}{2}$ of each other. We prove that a half-integral solution of the stronger LP-relaxation of cost $c$ can be rounded to an integral solution of cost at most $\frac{3}{2}c$. Additionally, we give a bad instance that presents obstructions to two obvious methods that aim for an approximation factor of $\frac{3}{2}$.

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

↑