Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights

Authors:
Tobias Berg;Harald Hempel
Affiliations:
Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany 07740;Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany 07740
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 4
Cited 3

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Implementation of algorithms for maximum matching on nonbipartite graphs.

Implementation of algorithms for maximum matching on nonbipartite graphs.
On the hardness of reoptimization

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Reoptimization of minimum and maximum traveling salesman's tours

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

Cybernetics and Systems Analysis
On the Hardness of Reoptimization with Multiple Given Solutions

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Reoptimization of maximum weight induced hereditary subgraph problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following optimization problem: Given an instance of an optimization problem and some optimum solution for this instance, we want to find a good solution for a slightly modified instance. Additionally, the scenario is addressed where the solution for the original instance is not an arbitrary optimum solution, but is chosen amongst all optimum solutions in a most helpful way. In this context, we examine reoptimization of the travelling salesperson problem, in particular MinTSP and MaxTSP as well as their corresponding metric versions. We study the case where the weight of a single edge is modified. Our main results are the following: existence of a 4/3-approximation for the metric MinTSP-problem, a 5/4-approximation for MaxTSP, and a PTAS for the metric version of MaxTSP.