Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Baburin, Aleksei; Della Croce, Federico; Gimadi, Edward; Glazkov, Yuri; Paschos, Vangelis (2009), Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2, Discrete Applied Mathematics, 157, 9, p. 1988-1992. http://dx.doi.org/10.1016/j.dam.2008.06.025
TypeArticle accepté pour publication ou publié
Journal nameDiscrete Applied Mathematics
MetadataShow full item record
Abstract (EN)The NP-hard problem of finding two edge-disjoint Hamiltonian cycles of minimal total weight (also known as 2- PSPmin) in a complete (undirected) graph with edge weights 1 and 2 is considered. Polynomial time approximation algorithms are proposed with performance ratios 5/4 (in the case of one weight function) and 11/7 (in the case of two weight functions), respectively.
Subjects / KeywordsFactor; Matching; Approximation; 2-peripatetic salesman problem
Showing items related by title and author.
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem Grosso, Andrea; Della Croce, Federico; Paschos, Vangelis (2004) Article accepté pour publication ou publié