Approximability of the Multiple Stack TSP

Details Approximability of the Multiple Stack TSP Approximability of the Multiple Stack TSP

2010-09-25

arxiv.org/abs/1009.5030v1

Computer Science

Computational Complexity

Scientific paper

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 Max2STSP, Max2STSP12 and Min2STSP12.

Affiliated with

Also associated with

No associations

Rating

Approximability of the Multiple Stack TSP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximability of the Multiple Stack TSP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximability of the Multiple Stack TSP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696084