|
|||||
|
|
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 |
|
| Authors: | A.E. Baburin E.K. Gimadi |
| Affiliation: | a Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia b D.A.I., Politecnico di Torino, Torino, Italy c LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, Paris, France |
| 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: | 2-peripatetic salesman problem Approximation Matching Factor |
| 本文献已被 ScienceDirect 等数据库收录！ | |