Title of article
Approximability of the Multiple Stack TSP
Author/Authors
Toulouse، نويسنده , , Sophie، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
813
To page
820
Abstract
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notably establish that asymmetric MaxSTSP and MinSTSP12 are APX, and propose a heuristic that yields to a 1/2, 3/4 and 3/2 standard approximation for respectively MaxSTSP, MaxSTSP12 and MinSTSP12.
Keywords
approximation algorithms , multiple stack TSP , TSP , LIFO constraints
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455515
Link To Document