{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:09:35Z","timestamp":1648994975140},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,5]],"date-time":"2014-12-05T00:00:00Z","timestamp":1417737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9818-x","type":"journal-article","created":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T23:59:25Z","timestamp":1417651165000},"page":"1206-1220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving robustness of next-hop routing"],"prefix":"10.1007","volume":"31","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Sean","family":"Kennedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon","family":"Wilfong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,5]]},"reference":[{"key":"9818_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg S, Corneil D, Proskurowski A (1987) Complexity of finding embeddings in a $$k$$ k -tree. SIAM J Algebraic Discrete Methods 8:277\u2013284","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"9818_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B Baker","year":"1994","unstructured":"Baker B (1994) Approximation algorithms for NP-complete problems on planar graphs. J ACM 41:153\u2013180","journal-title":"J ACM"},{"key":"9818_CR3","first-page":"1","volume":"11","author":"H Bodlaender","year":"1993","unstructured":"Bodlaender H (1993) A tourist guide through treewidth. Acta Cybern 11:1\u201323","journal-title":"Acta Cybern"},{"issue":"6","key":"9818_CR4","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H Bodlaender","year":"1996","unstructured":"Bodlaender H (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25(6):1305\u20131317","journal-title":"SIAM J Comput"},{"key":"9818_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-55121-2_2","volume-title":"Graph-theoretic concepts in computer science","author":"B Courcelle","year":"1992","unstructured":"Courcelle B, Mosbah M (1992) Monadic second-order evaluations on tree-decomposable graphs. In: Schmidt Gunther, Berghammer Rudolf (eds) Graph-theoretic concepts in computer science, vol 570., Lecture Notes in Computer ScienceSpringer, Berlin\/Heidelberg, pp 13\u201324"},{"key":"9818_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco, CA"},{"issue":"2","key":"9818_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/SURV.2011.011411.00065","volume":"14","author":"M Goyal","year":"2012","unstructured":"Goyal M, Soperi M, Baccelli E, Choudhury G, Shaikh A, Hosseini H, Trivedi K (2012) Improving convergence speed and scalability in OSPF: a survey. IEEE Commun Surv Tutor 14(2):443\u2013463","journal-title":"IEEE Commun Surv Tutor"},{"key":"9818_CR8","doi-asserted-by":"crossref","unstructured":"Hedrick C (1988) Routing information protocol. RFC 1058","DOI":"10.17487\/rfc1058"},{"key":"9818_CR9","doi-asserted-by":"crossref","unstructured":"Moy J (1998) OSPF Version 2. RFC 2178","DOI":"10.17487\/rfc2328"},{"key":"9818_CR10","doi-asserted-by":"crossref","unstructured":"Oran D (1990) OSI IS-IS intra-domain routing protocol. RFC 1142","DOI":"10.17487\/rfc1142"},{"issue":"8","key":"9818_CR11","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1016\/j.comnet.2006.09.010","volume":"51","author":"A Raj","year":"2007","unstructured":"Raj A, Ibe O (2007) A survey of IP and multiprotocol label switching fast reroute schemes. Comput Netw 51(8):1882\u20131907","journal-title":"Comput Netw"},{"key":"9818_CR12","doi-asserted-by":"crossref","unstructured":"Vo HQ, Lysne O, Kvalbein A (2012) Permutation routing for increased robustness in IP networks. In: Proceedings of the 11th international IFIP TC 6 conference on networking, vol I, pp 217\u2013231","DOI":"10.1007\/978-3-642-30045-5_17"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9818-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9818-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9818-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T00:02:24Z","timestamp":1566086544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9818-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9818"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9818-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,5]]}}}