Approximating Multi-Criteria Max-TSP

Abstract. We present randomized approximation algorithms for multicriteria 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 - . 1 Multi-Criteria Traveling Salesman Problem

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Markus Bläser, Bodo Manthey, Oliver Putz
• Keywords: Approximation Algorithms, Approximation Ratio, Arbitrarily Small, CORR 2008, Education