Approximating Multi-criteria Max-TSP

  • Markus Bläser
  • Bodo Manthey
  • Oliver Putz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)

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\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
  2. 2.
    Bläser, M., Manthey, B., Putz, O.: Approximating multi-criteria Max-TSP. Computing Research Repository (2008) arXiv:0806.3668 [cs.DS]Google Scholar
  3. 3.
    Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processing Letters 95(2), 333–342 (2005)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)MATHGoogle Scholar
  5. 5.
    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)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Manthey, B.: Approximate pareto curves for the asymmetric traveling salesman problem. Computing Research Repository (2007) cs.DS/0711.2157, arXivGoogle Scholar
  7. 7.
    Manthey, B., Ram, L.S.: Approximation algorithms for multi-criteria traveling salesman problems. Algorithmica (to appear)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Markus Bläser
    • 1
  • Bodo Manthey
    • 1
  • Oliver Putz
    • 1
  1. 1.Computer ScienceSaarland UniversitySaarbrückenGermany

Personalised recommendations