{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:37:46Z","timestamp":1743086266220,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_8","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"78-91","source":"Crossref","is-referenced-by-count":5,"title":["Reoptimization of the Shortest\u00a0Common\u00a0Superstring\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"M\u00f6mke","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Seibert","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Zych","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","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":"8_CR2","unstructured":"Archetti, C., Bertazzi, L., Speranza, M.G.: Reoptimizing the 0-1 knapsack problem. Technical Report 267, University of Brescia (2006)"},{"key":"8_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)"},{"key":"8_CR4","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., B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., M\u00f6mke, T., Widmayer, P., Zych, A.: Reoptimization of Steiner trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 258\u2013269. Springer, Heidelberg (2008)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-540-93980-1_16","volume-title":"WAOA 2008","author":"D. Bil\u00f2","year":"2009","unstructured":"Bil\u00f2, D., Widmayer, P., Zych, A.: Reoptimization of weighted graph and covering problems. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 201\u2013213. Springer, Heidelberg (2009)"},{"key":"8_CR6","series-title":"Natural Computing Series","volume-title":"Algorithmic Aspects of Bioinformatics","author":"H.-J. B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.-J., Bongartz, D.: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Heidelberg (2007)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-0-387-34735-6_21","volume-title":"Proc. of the Fourth IFIP International Conference on Theoretical Computer Science (IFIP TCS 2006)","author":"H.-J. B\u00f6ckenhauer","year":"2006","unstructured":"B\u00f6ckenhauer, H.-J., Forlizzi, L., Hromkovi\u010d, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: Reusing optimal TSP solutions for locally modified input instances (extended abstract). In: Proc. of the Fourth IFIP International Conference on Theoretical Computer Science (IFIP TCS 2006), vol.\u00a0209, pp. 251\u2013270. Springer, Heidelberg (2006)"},{"key":"8_CR8","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., M\u00f6mke, T., Rossmanith, P.: Reoptimization of Steiner trees: Changing the terminal set. Theoretical Computer Science (to appear)"},{"key":"8_CR9","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":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-85238-4_12","volume-title":"Mathematical Foundations of Computer Science 2008","author":"H.-J. B\u00f6ckenhauer","year":"2008","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D.: Reoptimization of the metric deadline TSP. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 156\u2013167. Springer, Heidelberg (2008)"},{"key":"8_CR11","unstructured":"Escoffier, B., Milanic, M., Paschos, V.T.: Simple and fast reoptimizations for the Steiner tree problem. Technical Report 2007-01, DIMACS (2007)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","volume":"20","author":"J. Gallant","year":"1980","unstructured":"Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. Journal of Computer and System Sciences\u00a020(1), 50\u201358 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(96)00042-X","volume":"72","author":"M.W. Sch\u00e4ffter","year":"1997","unstructured":"Sch\u00e4ffter, M.W.: Scheduling with forbidden sets. Discrete Applied Mathematics\u00a072(1-2), 155\u2013166 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR14","unstructured":"Setubal, C., Meidanis, J.: Introduction to Computational Molecular Biology. Natural Computing Series. PWS Publishing Company (1997)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"2000","unstructured":"Sweedyk, Z.: A \n                  \n                    \n                  \n                  $2{1\\over2}$\n                -approximation algorithm for shortest superstring. SIAM Journal on Computing\u00a029(3), 954\u2013986 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","volume":"57","author":"J. Tarhio","year":"1988","unstructured":"Tarhio, J., Ukkonen, E.: A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science\u00a057(1), 131\u2013145 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(98)00151-6","volume":"91","author":"S. Hoesel Van","year":"1999","unstructured":"Van Hoesel, S., Wagelmans, A.: On the complexity of postoptimality analysis of 0\/1 programs. Discrete Applied Mathematics\u00a091(1-3), 251\u2013263 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/11549345_68","volume-title":"Mathematical Foundations of Computer Science 2005","author":"V. Vassilevska","year":"2005","unstructured":"Vassilevska, V.: Explicit inapproximability bounds for the shortest superstring problem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 793\u2013800. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:30:58Z","timestamp":1578529858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_8"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}