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

Authors:
A. E. Baburin;F. Della Croce;E. K. Gimadi;Y. V. Glazkov;V. Th. Paschos
Affiliations:
Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia;D.A.I., Politecnico di Torino, Torino, Italy;Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia;Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia;LAMSADE, CNRS UMR7024 and Université Paris-Dauphine, Paris, France
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 3
Cited 0

The traveling salesman problem with distances one and two

Mathematics of Operations Research
A heuristic approach to the overnight security service problem

Computers and Operations Research
8/7-approximation algorithm for (1,2)-TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Quantified Score

Hi-index	0.04

Visualization

Abstract

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