Asymptotically Optimal Algorithm for Finding One and Two Edge-Disjoint Traveling Salesman Routes of Maximal Weight in Euclidean Space

被引：9
|
作者：
Gimadi, E. Kh. [1 ]
机构：
[1] Russian Acad Sci, Sobolev Inst Math, Siberian Div, Novosibirsk 630090, Russia
来源：
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS | 2008年 / 263卷 / Suppl 2期
基金：
俄罗斯基础研究基金会;
关键词：
STEKLOV Institute; Travel Salesman Problem; Travel Salesman Problem; Hamiltonian Cycle; Hamiltonian Path;
D O I：
10.1134/S0081543808060072
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：S57 / S67
页数：11
相关论文
共 10 条
1