{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:00:49Z","timestamp":1743048049486,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_33","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:01:51Z","timestamp":1294138911000},"page":"394-405","source":"Crossref","is-referenced-by-count":2,"title":["Structural Properties of Hard Metric TSP Inputs"],"prefix":"10.1007","author":[{"given":"Tobias","family":"M\u00f6mke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Arge, L., Italiano, G.F., Sedgewick, R. (eds.) Proc. of the 6th Workshop on Algorithmic Engineering and Experiments (ALENEX 2004), pp. 62\u201369. Society for Industrial and Applied Mathematics (2004)"},{"issue":"3","key":"33_CR2","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\u00a042(3), 154\u2013159 (2003)","journal-title":"Networks"},{"key":"33_CR3","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.\u00a04059, pp. 196\u2013207. Springer, Heidelberg (2006)"},{"issue":"2","key":"33_CR4","first-page":"83","volume":"2","author":"H.J. B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.J., Forlizzi, L., Hromkovi\u010d, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: On the approximability of TSP on local modifications of optimally solved instances. Algorithmic Oper.\u00a0Res.\u00a02(2), 83\u201393 (2007)","journal-title":"Algorithmic Oper.\u00a0Res."},{"issue":"1","key":"33_CR5","first-page":"3","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.\u00a0Comput.\u00a0Sci.\u00a0285(1), 3\u201324 (2002)","journal-title":"Theor.\u00a0Comput.\u00a0Sci."},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-77566-9_5","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"H.J. B\u00f6ckenhauer","year":"2008","unstructured":"B\u00f6ckenhauer, H.J., Hromkovi\u010d, J., M\u00f6mke, T., Widmayer, P.: On the hardness of reoptimization. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 50\u201365. Springer, Heidelberg (2008)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.J., Hromkovi\u010d, J., Seibert, S.: Stability of approximation. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall\/CRC Computer and Information Science Series, ch. 31. Chapman & Hall\/CRC (2007)","DOI":"10.1201\/9781420010749.ch31"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-13073-1_7","volume-title":"Algorithms and Complexity","author":"H.J. B\u00f6ckenhauer","year":"2010","unstructured":"B\u00f6ckenhauer, H.J., Klasing, R., M\u00f6mke, T., Steinov\u00e1, M.: Improved approximations for TSP with simple precedence constraints. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 61\u201372. Springer, Heidelberg (2010)"},{"issue":"1","key":"33_CR9","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. Journal of Discrete Algorithms\u00a08(1), 87\u2013100 (2010)","journal-title":"Journal of Discrete Algorithms"},{"key":"33_CR10","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)"},{"key":"33_CR11","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Paired approximation problems and incompatible inapproximabilities. In: Charikar, M. (ed.) Proc.\u00a0of the 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA\u00a02010), pp. 1076\u20131086. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.87"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 1\u201312. Springer, Heidelberg (2003)"},{"issue":"1","key":"33_CR14","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. Algorithmic Oper.\u00a0Res.\u00a01(1), 31\u201345 (2006)","journal-title":"Algorithmic Oper.\u00a0Res."},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010045","volume":"28","author":"N. Guttmann-Beck","year":"2000","unstructured":"Guttmann-Beck, N., Hassin, R., Khuller, S., Raghavachari, B.: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica\u00a028(4), 422\u2013437 (2000)","journal-title":"Algorithmica"},{"issue":"5","key":"33_CR16","first-page":"291","volume":"10","author":"J.A. Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of Christofides\u2019 heuristic: some paths are more difficult than cycles. Oper.\u00a0Res.\u00a0Lett.\u00a010(5), 291\u2013295 (1991)","journal-title":"Oper.\u00a0Res.\u00a0Lett."},{"key":"33_CR17","series-title":"An EATCS Series","volume-title":"Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Texts in Theoretical Computer Science","author":"J. Hromkovi\u010d","year":"2003","unstructured":"Hromkovi\u010d, J.: Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2003)"},{"key":"33_CR18","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, USA (2006)"},{"issue":"1","key":"33_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00493-006-0008-z","volume":"26","author":"C.H. Papadimitriou","year":"2006","unstructured":"Papadimitriou, C.H., Vempala, S.: On the approximability of the traveling salesman problem. Combinatorica\u00a026(1), 101\u2013120 (2006)","journal-title":"Combinatorica"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-45078-8_41","volume-title":"Algorithms and Data Structures","author":"E. Prieto","year":"2003","unstructured":"Prieto, E., Sloper, C.: Either\/or: using vertex cover structure in designing FPT-algorithms\u2014the case of k-Internal Spanning Tree. In: Dehne, F.K.H.A., Sack, J.R., Smid, M.H.M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 474\u2013483. Springer, Heidelberg (2003)"},{"issue":"3","key":"33_CR21","first-page":"555","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.F.: P-complete approximation problems. J.\u00a0ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"J.\u00a0ACM"},{"key":"33_CR22","first-page":"1","volume-title":"Proc.\u00a0of the 17th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA\u00a02006)","author":"V. Vassilevska","year":"2006","unstructured":"Vassilevska, V., Williams, R., Woo, S.L.M.: Confronting hardness using a hybrid approach. In: Proc.\u00a0of the 17th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA\u00a02006), pp. 1\u201310. Society for Industrial and Applied Mathematics, New York (2006)"},{"key":"33_CR23","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall Inc., Upper Saddle River (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:50:07Z","timestamp":1578520207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_33"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}