{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:12Z","timestamp":1725846792662},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_8","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"95-106","source":"Crossref","is-referenced-by-count":0,"title":["Robust Recoverable Path Using Backup Nodes"],"prefix":"10.1007","author":[{"given":"Marjan","family":"van den Akker","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[]},{"given":"Han","family":"Hoogeveen","sequence":"additional","affiliation":[]},{"given":"Erik","family":"van Ommeren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TVT.2012.2212734","volume":"62","author":"AA Abbasi","year":"2013","unstructured":"Abbasi, A.A., Younis, M.F., Baroudi, U.A.: Recovering from a node failure in wireless sensor-actor networks with minimal topology changes. IEEE Trans. Veh. Technol. 62(1), 256\u2013271 (2013)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40450-4_1","volume-title":"Algorithms \u2013 ESA 2013","author":"D Adjiashvili","year":"2013","unstructured":"Adjiashvili, D., Oriolo, G., Senatore, M.: The online replacement path problem. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 1\u201312. Springer, Heidelberg (2013)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-319-14115-2_37","volume-title":"Combinatorial Optimization","author":"E \u00c1lvarez-Miranda","year":"2014","unstructured":"\u00c1lvarez-Miranda, E., Candia-V\u00e9jar, A., Carrizosa, E., P\u00e9rez-Galarce, F.: Vulnerability assessment of spatial networks: models and solutions. In: Fouilhoux, P., Gouveia, L.E.N., Mahjoub, A.R., Paschos, V.T. (eds.) ISCO 2014. LNCS, vol. 8596, pp. 433\u2013444. Springer, Heidelberg (2014)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.2014.0606","volume":"27","author":"E \u00c1lvarez-Miranda","year":"2015","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., Raghavan, S., Toth, P.: The recoverable robust two-level network design problem. INFORMS J. Comput. 27(1), 1\u201319 (2015)","journal-title":"INFORMS J. Comput."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-05465-5_9","volume-title":"Robust and Online Large-Scale Optimization","author":"C B\u00fcsing","year":"2009","unstructured":"B\u00fcsing, C.: The exact subgraph recoverable robust shortest path problem. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 231\u2013248. Springer, Heidelberg (2009)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.20487","volume":"59","author":"C B\u00fcsing","year":"2012","unstructured":"B\u00fcsing, C.: Recoverable robust shortest path problems. Networks 59(1), 181\u2013189 (2012)","journal-title":"Networks"},{"key":"8_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"8_CR8","unstructured":"Nanda, A., Rath, A.K., Rout, S.K.: Node sensing & dynamic discovering routes for wireless sensor networks. Computing Research Repository (CoRR), \n                      abs\/1004.1678\n                      \n                     (2010)"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46(3), 362\u2013394 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ins.2004.09.016","volume":"176","author":"Y-H Wang","year":"2006","unstructured":"Wang, Y.-H., Chao, C.-F.: Dynamic backup routes routing protocol for mobile ad hoc networks. Inf. Sci. 176(2), 161\u2013185 (2006)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T18:17:42Z","timestamp":1539281862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}