Skip to main content
Conference Proceedings

An improved exact algorithm for cubic graph TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4598 LNCS 108-117
DOI: 10.1007/978-3-540-73545-8_13
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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.251n), improving the previous bound O(1.260n) by Eppstein. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Iwama, K., & Nakashima, T. (2007). An improved exact algorithm for cubic graph TSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4598 LNCS, pp. 108–117). Springer Verlag. https://doi.org/10.1007/978-3-540-73545-8_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free