Labeled Traveling Salesman Problems: Complexity and approximation

We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of colors. We derive results regarding hardness of approximation and analyze approximation algorithms, for both versions of the problem. For the maximization version we give a $1/2$-approximation algorithm based on local improvements and show that the problem is APX-hard. For the minimization version, we show that it is not approximable within $n^{1-\epsilon}$ for any fixed $\epsilon>0$. When every color appears in the graph at most $r$ times and $r$ is an increasing function of $n$, the problem is shown not to be approximable within factor $O(r^{1-\epsilon})$. For fixed constant $r$ we analyze a polynomial-time $(r +H_r)/2$ approximation algorithm, where $H_r$ is the $r$-th harmonic number, and prove APX-hardness for $r = 2$. For all of the analyzed algorithms we exhibit tightness of their analysis by provision of appropriate worst-case instances

On Labeled Traveling Salesman Problems

Abstract. We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions of the problem. For the maximization version we give a 1-approximation algorithm and show that it is APX-2 hard. For the minimization version, we show that it is not approximable within n 1−ǫ for every ǫ> 0. When every color appears in the graph at most r times and r is an increasing function of n the problem is not O(r 1−ǫ)-approximable. For fixed constant r we analyze a polynomialtime (r+Hr)/2-approximation algorithm (Hr is the r-th harmonic number), and prove APX-hardness. Analysis of the studied algorithms is shown to be tight.