Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
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.
Unable to display preview. Download preview PDF.
- 1.Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)Google Scholar
- 6.Liberatore, P.: The complexity of modified instances. arXiv.org cs/0402053 (2004)Google Scholar
- 10.Gabow, H.: Implementation of algorithms for maximum matching on nonbipartite graphs, Ph.D. Thesis, Stanford University (1974)Google Scholar
- 11.Barvinok, A., Gimadi, E.K., Serdyukow, A.I.: The Maximum Traveling Salesman Problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 585–608. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar