Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

118

Voted

CORR
2010
Springer

148views Education» more CORR 2010»

Approximability of the Multiple Stack TSP

15 years 2 months ago

Approximability of the Multiple Stack TSP

Download www-lipn.univ-paris13.fr

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.

Sophie Toulouse

Real-time Traffic

CORR 2010 | Delivery Tours | Distinct Networks | Education | LIFO Contraints |

claim paper

Related Content

» On the Complexity of the Multiple Stack TSP kSTSP

» Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

» Quality of Service and MaxMin Fair Transmit Beamforming to Multiple Cochannel Multicast Gr...

» Digital Computation of Linear Canonical Transforms

» Approximation Bounds for Semidefinite Relaxation of MaxMinFair Multicast Transmit Beamform...

» LowComplexity MIMO Multiuser Receiver A Joint Antenna Detection Scheme for TimeVarying Cha...

» Modeling and identification of nonlinear systems in the shorttime fourier transform domain

» A low complexity blind estimator of narrowband polynomial phase signals

» TreadMarks Distributed Shared Memory on Standard Workstations and Operating Systems

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Sophie Toulouse

Comments (0)