Algorithms for the universal and a priori traveling salesman problem (TSP)

Algorithms for the universal and a priori traveling salesman problem (TSP)

0.00 Avg rating0 Votes
Article ID: iaor2009698
Country: Netherlands
Volume: 36
Issue: 1
Start Page Number: 1
End Page Number: 3
Publication Date: Jan 2008
Journal: Operations Research Letters
Authors: ,
Abstract:

We present two simple results for generalizations of the traveling salesman problem (TSP): for the universal TSP, we show that one can compute a tour that is universally optimal whenever the input is a tree metric. A (randomized) O(logn)-approximation algorithm for the a priori TSP follows as a corollary.

Reviews

Required fields are marked *. Your email address will not be published.