Abstract
We present randomized approximation algorithms for multi-criteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of \(\frac 1k - \varepsilon\) for arbitrarily small ε> 0. For Max-ATSP with k objective functions, we obtain a ratio of \(\frac{1}{k+1} - \varepsilon\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Bläser, M., Manthey, B., Putz, O.: Approximating multi-criteria Max-TSP. Computing Research Repository (2008) arXiv:0806.3668 [cs.DS]
Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processing Letters 95(2), 333–342 (2005)
Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)
Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.I.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Journal of the ACM 52(4), 602–626 (2005)
Manthey, B.: Approximate pareto curves for the asymmetric traveling salesman problem. Computing Research Repository (2007) cs.DS/0711.2157, arXiv
Manthey, B., Ram, L.S.: Approximation algorithms for multi-criteria traveling salesman problems. Algorithmica (to appear)
Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. of the 41st Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 86–92. IEEE Computer Society, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bläser, M., Manthey, B., Putz, O. (2008). Approximating Multi-criteria Max-TSP. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)