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

旅行商问题的$\{0,1\}$-实例的控制算法

A domination algorithm for $\{0,1\}$-instances of the travelling salesman problem

Daniela Kühn, Deryk Osthus, Viresh Patel

摘要:

我们提出了一个近似算法的$\{0,1\}$-旅行推销员问题的情况下,表现良好的组合优势。更准确地说,我们给出了一个多项式时间算法,它具有优势比$1-n^{-1/29}$。换句话说,给定完全图$K_n$在$n$顶点上的$\{0,1\}$-边权,我们的算法输出$K_n$的一个Hamilton圈$H^*$,它具有以下性质:$K_n$的Hamilton圈中权小于$H^*$的Hamilton圈所占的比例至多为$n^{-1/29}$.我们的分析是基于鞅方法。以前,在这个方向上的最好的结果是一个多项式时间的算法与支配比$1/2-o(1)$为任意边权重。我们还证明了一个硬度结果表明,如果指数时间假设成立,存在一个常数$C$,使得$n^{-1/29}$不能被替换为$\exp(-(\log n)^C)$在上面的结果。

英文摘要:

We present an approximation algorithm for $\{0,1\}$-instances of the travelling salesman problem which performs well with respect to combinatorial dominance. More precisely, we give a polynomial-time algorithm which has domination ratio $1-n^{-1/29}$. In other words, given a $\{0,1\}$-edge-weighting of the complete graph $K_n$ on $n$ vertices, our algorithm outputs a Hamilton cycle $H^*$ of $K_n$ with the following property: the proportion of Hamilton cycles of $K_n$ whose weight is smaller than that of $H^*$ is at most $n^{-1/29}$. Our analysis is based on a martingale approach. Previously, the best result in this direction was a polynomial-time algorithm with domination ratio $1/2-o(1)$ for arbitrary edge-weights. We also prove a hardness result showing that, if the Exponential Time Hypothesis holds, there exists a constant $C$ such that $n^{-1/29}$ cannot be replaced by $\exp(-(\log n)^C)$ in the result above.

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

↑