We present randomized approximation algorithms for multi-criteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1/k - ε for arbitrarily small ε > 0. For Max-ATSP with k objective functions, we obtain a ratio of 1/k+1 - ε. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bläser, M., Manthey, B., & Putz, O. (2008). Approximating multi-criteria Max-TSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 185–197). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_16
Mendeley helps you to discover research relevant for your work.