Single approximation for the biobjective Max TSP

Citations of this article
Mendeley users who have this article in their library.


We mainly study the Max TSP with two objective functions. We propose an algorithm which returns a single Hamiltonian cycle with performance guarantee on both objectives. The algorithm is analyzed in three cases. When both (respectively, at least one) objective function(s) fulfill(s) the triangle inequality, the approximation ratio is 5/12-ε≈0.41 (respectively, 3/8-ε). When the triangle inequality is not assumed on any objective function, the algorithm is 1+2√2/14-ε≈0.27-approximate. © 2013 Elsevier B.V. All rights reserved.




Bazgan, C., Gourvès, L., Monnot, J., & Pascual, F. (2013). Single approximation for the biobjective Max TSP. In Theoretical Computer Science (Vol. 478, pp. 41–50).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free