Jm. Phillips et al., A LINEAR-TIME ALGORITHM FOR THE BOTTLENECK TRAVELING SALESMAN PROBLEMON A HALIN GRAPH, Information processing letters, 67(2), 1998, pp. 105-110
Citations number
8
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
We provide a linear time algorithm to solve the bottleneck traveling s
alesman problem on a Halin graph. This improves the O(n log n) time bo
und obtained by the binary search version of the threshold algorithm.
(C) 1998 Elsevier Science B.V. All rights reserved.