{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:03:22Z","timestamp":1648908202344},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T00:00:00Z","timestamp":1152144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10878-006-8902-2","type":"journal-article","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T12:12:44Z","timestamp":1152187964000},"page":"17-34","source":"Crossref","is-referenced-by-count":0,"title":["Efficient algorithms for shared backup allocation in networks with partial information"],"prefix":"10.1007","volume":"12","author":[{"given":"Yigal","family":"Bejerano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Sprintson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,6]]},"reference":[{"key":"8902_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s00453-005-1156-z","volume":"43","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, Gupta A, Kumar A, Naor J, Raz D (2005) Building edge-failure resilient networks. Algorithmica 43:17\u201341","journal-title":"Algorithmica"},{"key":"8902_CR2","volume-title":"Computers and intractability","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability. Freeman, San Francisco"},{"key":"8902_CR3","doi-asserted-by":"crossref","unstructured":"Hwang H, Ahn S, Choi Y, Kim C (1998) Backup path sharing for survivable ATM networks. In: Proceedings of Twelfth International Conference on Information Networking (ICOIN-12) pp. 8\u201313","DOI":"10.1109\/ICOIN.1998.648344"},{"key":"8902_CR4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/TNET.2002.802141","volume":"10","author":"G Italiano","year":"2002","unstructured":"Italiano G, Rastogi R, Yener B (2002) Restoration algorithms for virtual private networks in the hose model. IEEE\/ACM Trans Netw 10:565\u2013578","journal-title":"IEEE\/ACM Trans Netw"},{"key":"8902_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TNET.2003.813044","volume":"11","author":"MS Kodialam","year":"2003","unstructured":"Kodialam MS, Lakshman TV (2003) Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network usage information. IEEE\/ACM Trans Netw 11:399\u2013410","journal-title":"IEEE\/ACM Trans Netw"},{"key":"8902_CR6","unstructured":"Li G, Wang D, Kalmanek C, Doverspike R (2002) Efficient distributed path selection for shared restoration connections. In: Proceedings of IEEE INFOCOM 02, New York, NY pp. 140\u2013149"},{"key":"8902_CR7","doi-asserted-by":"crossref","unstructured":"Sengupta S, Ramamurthy R (2001) Capacity efficient distributed routing of mesh-restored lightpaths in optical networks. In: Proceedings of IEEE Global Telecommunications Conference (GLOBECOM 01) pp. 2129\u20132133","DOI":"10.1109\/GLOCOM.2001.966157"},{"key":"8902_CR8","doi-asserted-by":"crossref","unstructured":"Su X, Su CF (2001) An online distributed protection algorithm in WDM networks. In: Proceedings of IEEE International Conference on Communications (ICC 01) pp. 1571\u20131575","DOI":"10.1109\/ICC.2001.937184"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8902-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-8902-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8902-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-8902-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,6]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["8902"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-8902-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,6]]}}}