An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure

The paper presents an O ∗ ( 1 . 2312 n ) -time and polynomial-space algorithm for the traveling salesman problem in an n -vertex graph with maximum degree 3. This improves all previous time bounds of polynomial-space algorithms for this problem. Our algorithm is a simple branch-and-search algorithm...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 74; H. 2; S. 713 - 741
Hauptverfasser:	Xiao, Mingyu, Nagamochi, Hiroshi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2016
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Measure and conquer Traveling salesman problem Exact exponential algorithm Connectivity Graph algorithm
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!