On the traveling salesman problem in binary hamming spaces

被引：3
|
作者：
Cohen, G [1 ]
Litsyn, S [1 ]
Zemor, G [1 ]
机构：
[1] TEL AVIV UNIV,DEPT ELECT ENGN SYST,IL-69978 RAMAT AVIV,ISRAEL
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 04期
关键词：
traveling salesman; Gray codes; minimal cycle; data compression;
D O I：
10.1109/18.508858
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a subset X of vertices of the n-cube (i.e., the n-dimensional Hamming space), we are interested in the solution of the traveling salesman problem; namely, the minimal length of a cycle passing through an vertices of X. For a given number nl, we estimate the maximum of these lengths when X ranges over ail possible choices of sets of nd vertices. Asymptotically, (pur estimates show that for a number M of vertices growing exponentially in n, the maximum is attained for a code with maximal possible minimum distance.
引用
收藏
页码：1274 / 1276
页数：3
相关论文
共 50 条
12345