RAIRO-Theor. Inf. Appl.
Volume 48, Number 5, December 2014
|Page(s)||479 - 494|
|Published online||06 November 2014|
Accepted: 31 March 2014
The traveling salesman problem is one of the most important problems in operations research, especially when additional precedence constraints are considered. Here, we consider the well-known variant where a linear order on k special vertices is given that has to be preserved in any feasible Hamiltonian cycle. This problem is called Ordered TSP and we consider it on input instances where the edge-cost function satisfies a β-relaxed triangle inequality, i.e., where the length of a direct edge cannot exceed the cost of any detour via a third vertex by more than a factor of β> 1. We design two new polynomial-time approximation algorithms for this problem. The first algorithm essentially improves over the best previously known algorithm for almost all values of k and β< 1.087889. The second algorithm gives a further improvement for 2n ≥ 11k + 7 and β< √34/3 , where n is the number of vertices in the graph.
Mathematics Subject Classification: 68Q25 / 68R10
Key words: Approximation algorithm / near-metric ordered TSP / relaxed triangle inequality
An extended abstract of this work has been presented at SOFSEM 2013 .
© EDP Sciences 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.