Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
P-Complete Approximation Problems
Journal of the ACM (JACM)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On the approximation hardness of some generalizations of TSP
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
In this paper, we consider the ordered TSP, a variant of the traveling salesman problem with precedence constraints, where the precedence constraints are such that a given subset of vertices has to be visited in some prescribed linear order. We give improved algorithms for the ordered TSP: For the metric case, we present a polynomial-time algorithm that guarantees an approximation ratio of 2.5-2/k, where k is the number of ordered vertices. For near-metric input instances satisfying a @b-relaxed triangle inequality, we improve the ratio to k@b^l^o^g^"^2^(^@?^3^k^/^2^@?^+^1^).