Approximating Multi-Criteria Max-TSP

Simple item page
dc.creatorBläser, Markus
dc.creatorManthey, Bodo
dc.creatorPutz, Oliver
dc.date2008-06-23
dc.date.accessioned2026-07-07T12:19:39Z
dc.date.available2026-07-07T12:19:39Z
dc.descriptionWe 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 - \eps$ for arbitrarily small $\eps > 0$. For Max-ATSP with k objective functions, we obtain an approximation ratio of $1/(k+1) - \eps$.
dc.descriptionAn extended abstract of this worl will appear in Proc. of the 16th Ann. European Symposium on Algorithms (ESA 2008)
dc.identifierhttps://arxiv.org/abs/0806.3668
dc.identifierhttp://arxiv.org/abs/0806.3668
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212829
dc.subjectData Structures and Algorithms
dc.subjectF.2.2; G.2.1; G.2.1
dc.titleApproximating Multi-Criteria Max-TSP
dc.typetext

Files

Collections

arXiv