An (8)-(13)-approximation algorithm for the asymmetric maximum Traveling Salesperson Problem

An (8)-(13)-approximation algorithm for the asymmetric maximum Traveling Salesperson Problem

0.00 Avg rating0 Votes
Article ID: iaor2006619
Country: Netherlands
Volume: 50
Issue: 1
Start Page Number: 23
End Page Number: 48
Publication Date: Jan 2004
Journal: Journal of Algorithms
Authors:
Abstract:

We present a polynomial time approximation algorithm for the asymmetric maximum traveling salesperson problem that achieves performance ratio 8/13(1 – 1/n). The running time of our algorithm is O(n3).

Reviews

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