关于Boyne-Carr猜想的一个证明
A Proof of the Boyd-Carr Conjecture
摘要:
确定旅行商问题的子回路LP松弛的精确完整性间隙是一个重要的开放问题,在对称成本服从三角不等式的一般情况下,三十年来几乎没有取得进展。Boyd和Carr [3]观察到,我们甚至不知道最佳2-匹配与子图LP之比的最坏情况上限;他们推测该比率至多为10/9。在本文中,我们证明了Boyne-Carr猜想。在分数2-匹配没有截边的情况下,我们可以进一步证明最优2-匹配的代价至多是分数2-匹配的10/9倍。
英文摘要:
Determining the precise integrality gap for the subtour LP relaxation of the traveling salesman problem is a significant open question, with little progress made in thirty years in the general case of symmetric costs that obey triangle inequality. Boyd and Carr [3] observe that we do not even know the worst-case upper bound on the ratio of the optimal 2-matching to the subtour LP; they conjecture the ratio is at most 10/9. In this paper, we prove the Boyd-Carr conjecture. In the case that a fractional 2-matching has no cut edge, we can further prove that an optimal 2-matching is at most 10/9 times the cost of the fractional 2-matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。