Cubic TSP - a 1.3-approximation
Discrete Mathematics
2016-10-13 v2 Optimization and Control
Abstract
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.
Cite
@article{arxiv.1506.06369,
title = {Cubic TSP - a 1.3-approximation},
author = {Barbora Candráková and Robert Lukoťka},
journal= {arXiv preprint arXiv:1506.06369},
year = {2016}
}
Comments
21 pages