1 research outputs found
Cubic TSP - a 1.3-approximation
We prove that every simple bridgeless cubic graph with n >= 8 vertices has a
travelling salesman tour of length at most 1.3n - 2, which can be constructed
in polynomial time.Comment: 21 page
1 research outputs found