Abstract
We consider the following (re)optimization problem: Given a minimum-cost Hamiltonian cycle of a complete non-negatively real weighted graph G = (V,E,c) obeying the strengthened triangle inequality (i.e., for some strength factor \(\frac{1}{2} \leq \beta <1\), we have that ∀ x,y,z ∈ V, c(x,y) ≤ β(c(x,z) + c(y,z))), and given a set of k edge weight modifications producing a new weighted graph still obeying the strengthened triangle inequality, find a minimum-cost Hamiltonian cycle of the modified graph. This problem is known to be NP-hard already for a single edge weight modification. However, in this case, if both the input and the modified graph obey the strengthened triangle inequality and the respective strength factors are fixed (i.e., independent of |V|), then it has been shown that the problem admits a PTAS (which just consists of either returning the old optimal cycle, or instead computing — for finitely many inputs — a new optimal solution from scratch, depending on the required accuracy in the approximation). In this paper we first extend the analysis of the PTAS to show its applicability for all k = O(1), and then we provide a large set of experiments showing that, in most practical circumstances, altering (uniformly at random) even several edge weights does not affect the goodness of the old optimal solution.
This work was partially supported by the PRIN 2008 research project COGENT (COmputational and GamE-theoretic aspects of uncoordinated NeTworks), funded by the Italian Ministry of Education, University, and Research.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
TSPLIB, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
UNESCO World Heritage Sites, http://en.wikipedia.org/wiki/World_Heritage_Sites
Concorde TSP Solver (2003), http://www.tsp.gatech.edu/concorde
Archetti, C., Bertazzi, L., Speranza, M.G.: Reoptimizing the traveling salesman problem. Networks 42(3), 154–159 (2003)
Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 196–207. Springer, Heidelberg (2006)
Bender, M.A., Chekuri, C.: Performance Guarantees for the TSP with a Parameterized Triangle Inequality. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 80–85. Springer, Heidelberg (1999)
Bilò, D., Böckenhauer, H.-J., Hromkovič, J., Královič, R., Mömke, T., Widmayer, P., Zych, A.: Reoptimization of Steiner Trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 258–269. Springer, Heidelberg (2008)
Bilò, D., Widmayer, P., Zych, A.: Reoptimization of Weighted Graph and Covering Problems. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 201–213. Springer, Heidelberg (2009)
Böckenhauer, H.-J., Forlizzi, L., Hromkovič, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: On the approximability of TSP on local modifications of optimally solved instances. Algorithmic Operations Research 2, 83–93 (2007)
Böckenhauer, H.-J., Hromkovič, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for TSP with sharpened triangle inequality. Information Processing Letters 75, 133–138 (2000)
Böckenhauer, H.-J., Hromkovič, J., Klasing, R., Seibert, S., Unger, W.: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theoretical Computer Science 285(1), 3–24 (2002)
Böckenhauer, H.-J., Hromkovič, J., Královic, R., Mömke, T., Rossmanith, P.: Reoptimization of Steiner trees: Changing the terminal set. Theoretical Computer Science 410(36), 3428–3435 (2009)
Böckenhauer, H.-J., Komm, D.: Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1), 87–100 (2010)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegy–Mellon University (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Andrea, A., Proietti, G. (2012). Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. In: Klasing, R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-30850-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30849-9
Online ISBN: 978-3-642-30850-5
eBook Packages: Computer ScienceComputer Science (R0)