Title of article
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 Original Research Article
Author/Authors
A.E. Baburin، نويسنده , , F. Della Croce، نويسنده , , E.K. Gimadi، نويسنده , , Y.V. Glazkov، نويسنده , , V.Th. Paschos، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
1988
To page
1992
Abstract
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.
Keywords
approximation , Factor , 2-peripatetic salesman problem , Matching
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887138
Link To Document