On the traveling salesman problem in binary Hamming spaces

DOI10.1109/18.508858MaRDI QIDQ4885735zbMATH OpenOpenAlexFDO

Authors Gilles Zémor, Gérard Cohen, Simon Litsyn

Publication date 12 December 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4452037ef4297effe511a900d10aa9d78ebc88f0

zbMATH Keywords

\(n\)-cubedata compressionGray codesHamming spacetraveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Source coding (94A29) Linear codes (general theory) (94B05)

Recommendations

• The traveling salesman problem for cubic graphs.
• On metric dimension of nonbinary Hamming spaces
• The Traveling Salesman Problem for Cubic Graphs
• On the extremal combinatorics of the Hamming space

Cited in

(1)

• NP-completeness of the Hamming salesman problem

This page was built for publication: On the traveling salesman problem in binary Hamming spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885735)