{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:45:25Z","timestamp":1743111925021,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983547"},{"type":"electronic","value":"9783319983554"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98355-4_10","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T10:34:57Z","timestamp":1533724497000},"page":"156-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stability of Reapproximation Algorithms for the $$\\beta $$-Metric Traveling Salesman (Path) Problem"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"D\u2019Andrea","sequence":"first","affiliation":[]},{"given":"Luca","family":"Forlizzi","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"issue":"2","key":"10_CR1","first-page":"59","volume":"38","author":"T Andreae","year":"2001","unstructured":"Andreae, T.: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Netw. Int. J. 38(2), 59\u201367 (2001)","journal-title":"Netw. Int. J."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480192240226","volume":"8","author":"T Andreae","year":"1995","unstructured":"Andreae, T., Bandelt, H.-J.: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discrete Math. 8(1), 1\u201316 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/net.10091","volume":"42","author":"C Archetti","year":"2003","unstructured":"Archetti, C., Bertazzi, L., Speranza, M.G.: Reoptimizing the traveling salesman problem. Networks 42(3), 154\u2013159 (2003)","journal-title":"Networks"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11785293_20","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"G Ausiello","year":"2006","unstructured":"Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of minimum and maximum traveling salesman\u2019s tours. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 196\u2013207. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11785293_20"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48447-7_10","volume-title":"Algorithms and Data Structures","author":"MA Bender","year":"1999","unstructured":"Bender, M.A., Chekuri, C.: Performance guarantees for the TSP with a parameterized triangle inequality. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 80\u201385. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48447-7_10"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-00982-2_12","volume-title":"Language and Automata Theory and Applications","author":"T Berg","year":"2009","unstructured":"Berg, T., Hempel, H.: Reoptimization of traveling salesperson problems: changing single edge-weights. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 141\u2013151. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_12"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00224-010-9289-0","volume":"49","author":"D Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, D., Forlizzi, L., Proietti, G.: Approximating the metric TSP in linear time. Theory Comput. Syst. 49(3), 615\u2013631 (2011)","journal-title":"Theory Comput. Syst."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-32589-2_19","volume-title":"Mathematical Foundations of Computer Science 2012","author":"D Bil\u00f2","year":"2012","unstructured":"Bil\u00f2, D., Zych, A.: New advances in reoptimizing the minimum Steiner tree problem. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 184\u2013197. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_19"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-69903-3_24","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"D Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, D., et al.: Reoptimization of Steiner trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 258\u2013269. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69903-3_24"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11785293_19","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"H-J B\u00f6ckenhauer","year":"2006","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kneis, J., Kupke, J.: On the approximation hardness of some generalizations of TSP. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 184\u2013195. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11785293_19"},{"issue":"1\u20133","key":"10_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2004.06.019","volume":"326","author":"H-J B\u00f6ckenhauer","year":"2004","unstructured":"B\u00f6ckenhauer, H.-J., et al.: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1\u20133), 137\u2013153 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.jda.2008.03.003","volume":"6","author":"H-J B\u00f6ckenhauer","year":"2008","unstructured":"B\u00f6ckenhauer, H.-J., et al.: On $$k$$-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4), 605\u2013617 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR13","first-page":"83","volume":"2","author":"H-J B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.-J., et al.: On the approximability of TSP on local modifications of optimally solved instances. Algorith. Oper. Res. 2, 83\u201393 (2007)","journal-title":"Algorith. Oper. Res."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jda.2011.03.014","volume":"11","author":"H-J B\u00f6ckenhauer","year":"2012","unstructured":"B\u00f6ckenhauer, H.-J., Freiermuth, K., Hromkovi\u010d, J., M\u00f6mke, T., Sprock, A., Steffen, B.: Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11, 73\u201386 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"H-J B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75, 133\u2013138 (2000)","journal-title":"Inf. Process. Lett."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/3-540-46541-3_32","volume-title":"STACS 2000","author":"H-J B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 382\u2013394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_32"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00287-0","volume":"285","author":"H-J B\u00f6ckenhauer","year":"2002","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285(1), 3\u201324 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00224-007-1347-x","volume":"41","author":"H-J B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kneis, J., Kupke, J.: The parameterized approximability of TSP with deadlines. Theory Comput. Syst. 41(3), 431\u2013444 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"36","key":"10_CR19","doi-asserted-by":"publisher","first-page":"3428","DOI":"10.1016\/j.tcs.2008.04.039","volume":"410","author":"H-J B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovic, R., M\u00f6mke, T., Rossmanith, P.: Reoptimization of Steiner trees: changing the terminal set. Theor. Comput. Sci. 410(36), 3428\u20133435 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"21\u201323","key":"10_CR20","doi-asserted-by":"publisher","first-page":"2241","DOI":"10.1016\/j.tcs.2009.02.016","volume":"410","author":"H-J B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Kneis, J., Kupke, J.: Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21\u201323), 2241\u20132249 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jda.2009.04.001","volume":"8","author":"H-J B\u00f6ckenhauer","year":"2010","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D.: Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1), 87\u2013100 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"10_CR22","first-page":"213","volume":"34","author":"H-J B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Seibert, S.: Improved lower bounds on the approximability of the traveling salesman problem. ITA 34(3), 213\u2013255 (2000)","journal-title":"ITA"},{"key":"10_CR23","unstructured":"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)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-30850-5_11","volume-title":"Experimental Algorithms","author":"A D\u2019Andrea","year":"2012","unstructured":"D\u2019Andrea, A., Proietti, G.: Reoptimizing the strengthened metric TSP on multiple edge weight modifications. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 111\u2013122. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30850-5_11"},{"issue":"1","key":"10_CR25","first-page":"31","volume":"1","author":"L Forlizzi","year":"2006","unstructured":"Forlizzi, L., Hromkovi\u010d, J., Proietti, G., Seibert, S.: On the stability of approximation for Hamiltonian path problems. Algorithm. Oper. Res. 1(1), 31\u201345 (2006)","journal-title":"Algorithm. Oper. Res."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-60207-8_21","volume-title":"Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa","author":"J Hromkovi\u010d","year":"1999","unstructured":"Hromkovi\u010d, J.: Stability of approximation algorithms and the knapsack problem. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 238\u2013249. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60207-8_21"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-47849-3_2","volume-title":"SOFSEM 1999: Theory and Practice of Informatics","author":"J Hromkovi\u010d","year":"1999","unstructured":"Hromkovi\u010d, J.: Stability of approximation algorithms for hard optimization problems. In: Pavelka, J., Tel, G., Barto\u0161ek, M. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 29\u201347. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-47849-3_2"},{"issue":"3","key":"10_CR28","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-36694-9_31","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Seb\u00f6","year":"2013","unstructured":"Seb\u00f6, A.: Eight-fifth approximation for the path TSP. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 362\u2013374. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_31"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Seb\u00f6, A., van Zuylen, A.: The salesman\u2019s improved paths: A 3\/2+1\/34 approximation. In: IEEE 57th Annual Symposium on Foundations of Computer Science. FOCS 2016, 9\u201311 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 118\u2013127 (2016)","DOI":"10.1109\/FOCS.2016.21"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. CoRR, abs\/1708.04215 (2017)","DOI":"10.1145\/3188745.3188824"},{"key":"10_CR32","first-page":"1","volume":"90","author":"J Vygen","year":"2012","unstructured":"Vygen, J.: New approximation algorithms for the TSP. OPTIMA 90, 1\u201312 (2012)","journal-title":"OPTIMA"}],"container-title":["Lecture Notes in Computer Science","Adventures Between Lower Bounds and Higher Altitudes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98355-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:56:05Z","timestamp":1710348965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98355-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983547","9783319983554"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98355-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}