Abstract
Many papers deal with the approximability of multi-criteria optimization problems but only a small number of non-approximability results, which rely on NP-hardness, exist in the literature. In this paper, we provide a new way of proving non-approximability results which relies on the existence of a small size good approximating set (i.e. it holds even in the unlikely event of P=NP). This method may be used for several problems but here we illustrate it for a multi-criteria version of the traveling salesman problem with distances one and two (TSP(1,2)). Following the article of Angel et al. (FCT 2003) who presented an approximation algorithm for the bi-criteria TSP(1,2), we extend and improve the result to any number k of criteria.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angel, E., Bampis, E., Gourvés, L.: Approximating the Pareto curve with local search for the bi-criteria TSP(1,2) problem. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 39–48. Springer, Heidelberg (2003)
Angel, E., Bampis, E., Gourvès, L., Monnot, J.: (Non)-Approximability for the multi-criteria TSP(1, 2). Technical Report, Université d’Évry Val d’Essonne, No 116-2005 (2005)
Deng, X., Papadimitriou, C.H., Safra, S.: On the Complexity of Equilibria. In: Proc. of STOC 2002, pp. 67–71 (2002)
Engebretsen, L.: An Explicit Lower Bound for TSP with Distances One and Two. Algorithmica 35(4), 301–318 (2003)
Fotakis, D., Spirakis, P.: A Hamiltonian Approach to the Assignment of Non- Reusable Frequencies. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 18–29. Springer, Heidelberg (1998)
Johnson, D.S., Papadimitriou, C.H.: Performance guarantees for heuristics. In: Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., Lawler, E.L. (eds.) The Traveling Salesman Problem: a guided tour of Combinatorial Optimization, pp. 145–180. Wiley Chichester, Chichester (1985)
Lucas, D.E.: Récréations mathématiques. vol. II. Gauthier Villars, Paris (1892)
Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. of FOCS 2000, pp. 86–92 (2000)
Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18(1), 1–11 (1993)
Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comp. 6, 563–581 (1977)
Warburton, A.: Approximation of Pareto optima in multiple-objective shortest path problems. Operations Research 35(1), 70–79 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angel, E., Bampis, E., Gourvès, L., Monnot, J. (2005). (Non)-Approximability for the Multi-criteria TSP(1,2). In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_29
Download citation
DOI: https://doi.org/10.1007/11537311_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)