Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2

doi:10.1016/j.dam.2008.06.025

Discrete Applied Mathematics

Volume 157, Issue 9, 6 May 2009, Pages 1988-1992

https://doi.org/10.1016/j.dam.2008.06.025 Get rights and content

Under an Elsevier user license

open archive

Abstract

The NP-hard problem of finding two edge-disjoint Hamiltonian cycles of minimal total weight (also known as 2- PSP_min) 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.

Keywords

2-peripatetic salesman problem

Approximation

Matching

Factor