Differential approximation of the multiple stacks TSP

Authors:
Sophie Toulouse
Affiliations:
LIPN (UMR CNRS 7030) - Institut Galilée, Université Paris 13, Villetaneuse, France
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 11
Cited 0

On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
z-Approximations

Journal of Algorithms
Differential approximation results for the traveling salesman and related problems

Information Processing Letters
Completeness in standard and differential approximation classes: poly-(D)APX- and (D)PTAS-completeness

Theoretical Computer Science
A better differential approximation ratio for symmetric TSP

Theoretical Computer Science
Approximation results for the weighted P4 partition problem

Journal of Discrete Algorithms
New differential approximation algorithm for k-customer vehicle routing problem

Information Processing Letters
On the Complexity of the Multiple Stack TSP, kSTSP

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

Theoretical Computer Science
The uncapacitated asymmetric traveling salesman problem with multiple stacks

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the multiple Stacks Travelling Salesman Problem, STSP, one has to collect and then to deliver n commodities in two distinct cities, using a single container whose rows are subject to LIFO constraints. We prove that the STSP with 2 rows, tight capacity ⌈n/2⌉ and no depot vertex is differential 1/2−o(1)−approximable.