随机嵌入随机图中的旅行
Traveling in randomly embedded random graphs
摘要:
考虑欧几里得空间中随机点间的旅行问题,其中只有一个随机部分的点对由可通过的联络连接。特别是,我们展示了一个阈值,一对点连接的长度任意接近其欧氏距离的测地线,并分析了最小长度的旅行推销员旅游,延长Beardwood-Halton-Hammersley定理,这个设置。
英文摘要:
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a geodesic of length arbitrarily close to their Euclidean distance, and analyze the minimum length Traveling Salesperson Tour, extending the Beardwood-Halton-Hammersley theorem to this setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。