Chapter

Computing and Combinatorics

Volume 4598 of the series Lecture Notes in Computer Science pp 108-117

An Improved Exact Algorithm for Cubic Graph TSP

  • Kazuo IwamaAffiliated withSchool of Informatics, Kyoto University, Kyoto 606-8501
  • , Takuya NakashimaAffiliated withSchool of Informatics, Kyoto University, Kyoto 606-8501

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.