arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.10356math.OC
收藏

用阻力-距离矩阵解哈密顿圈问题的注记

A Note on Using the Resistance-Distance Matrix to solve Hamiltonian Cycle Problem

Vladimir Ejov, Jerzy A Filar, Michael Haythorpe, John F Roddick, Serguei Rossomakhine

摘要:

一个哈密顿圈问题的实例可以通过将其转换为一个流动推销员问题的实例来解决,为底层图的边分配任何选择的权重。在本文中,我们证明,对于困难的情况下,选择边的权重是它的两个入射顶点之间的电阻距离往往是一个很好的选择。我们还证明,可以说更强的性能产生于使用电阻距离的倒数。提供的例子表明从这些选择中获得的好处。

英文摘要:

An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying graph. In this note we demonstrate that, for difficult instances, choosing the edge weights to be the resistance distance between its two incident vertices is often a good choice. We also demonstrate that arguably stronger performance arises from using the inverse of the resistance distance. Examples are provided demonstrating benefits gained from these choices.

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

↑