Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space

被引：0
|
作者：
E. Kh. Gimadi
机构：
[1] Siberian Division of the Russian Academy of Sciences,Sobolev Institute of Mathematics
来源：
Proceedings of the Steklov Institute of Mathematics | 2008年 / 263卷
关键词：
STEKLOV Institute; Travel Salesman Problem; Travel Salesman Problem; Hamiltonian Cycle; Hamiltonian Path;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The paper presents a polynomial approximation algorithm A solving the problem of finding one and two edge-disjoint Hamiltonian cycles (traveling salesman routes) of maximal weight in a complete weighted undirected graph in multidimensional Euclidean space. The asymptotic optimality of the algorithm is established.
引用
收藏
页码：57 / 67
页数：10
相关论文
共 10 条
1