TSP Tours in Cubic Graphs: Beyond 4/3

DOI10.1007/978-3-642-33090-2_68zbMath1365.90227arXiv1310.1896OpenAlexW1828670314MaRDI QIDQ2912895

Jose A. Soto, Omar Larré, José R. Correa

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.1896

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Approximation hardness of graphic TSP on cubic graphs ⋮ The traveling salesman problem on cubic and subcubic graphs

This page was built for publication: TSP Tours in Cubic Graphs: Beyond 4/3