An Improved Exact Algorithm for Cubic Graph TSP

* Final gross prices may vary according to local VAT.

Get Access


It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251 n ), improving the previous bound O(1.260 n ) by Eppstein.