{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T14:25:57Z","timestamp":1698330357296},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T00:00:00Z","timestamp":1297123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11590-011-0283-5","type":"journal-article","created":{"date-parts":[[2011,2,7]],"date-time":"2011-02-07T07:25:21Z","timestamp":1297063521000},"page":"571-584","source":"Crossref","is-referenced-by-count":1,"title":["A multicast problem with shared risk cost"],"prefix":"10.1007","volume":"6","author":[{"given":"Zhe","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanpracha Art","family":"Chaovalitwongse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,8]]},"reference":[{"issue":"2","key":"283_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Aneja Y.P.: An integer linear programming approach to the Steiner problem in graphs. Networks 10(2), 167\u2013178 (1980)","journal-title":"Networks"},{"issue":"5","key":"283_CR2","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan A., Magnanti T.L., Wong R.T.: A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37(5), 716\u2013740 (1989)","journal-title":"Oper. Res."},{"issue":"16","key":"283_CR3","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1016\/j.comnet.2009.07.005","volume":"53","author":"M. Cha","year":"2009","unstructured":"Cha M., Chaovalitwongse W.A., Moon S., Shaikh A., Yates J.: Efficient and scalable provisioning solutions for always-on multicast streaming services. Comput. Netw. 53(16), 2825\u20132839 (2009)","journal-title":"Comput. Netw."},{"key":"283_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"key":"283_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"1","author":"M.X. Goemans","year":"1993","unstructured":"Goemans M.X., Myung Y.A.: Catalog of Steiner tree formulations. Networks 1, 19\u201328 (1993)","journal-title":"Networks"},{"issue":"18","key":"283_CR6","doi-asserted-by":"crossref","first-page":"3635","DOI":"10.1016\/j.ins.2008.05.023","volume":"178","author":"L. Guo","year":"2008","unstructured":"Guo L., Wang X., Song Q., Wei X., Hou W., Yang T., Yang F.: New insights on survivability in multi-domain optical networks. Inf. Sci. 178(18), 3635\u20133644 (2008)","journal-title":"Inf. Sci."},{"issue":"4\u20136","key":"283_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.optcom.2004.11.041","volume":"246","author":"L. Guo","year":"2005","unstructured":"Guo L., Yu H., Li L.: A new shared-path protection algorithm under shared risk link group constraints for survivable WDM mesh networks. Opt. Commun. 246(4\u20136), 285\u2013295 (2005)","journal-title":"Opt. Commun."},{"issue":"3","key":"283_CR8","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"J.Q. Hu","year":"2003","unstructured":"Hu J.Q.: Diverse routing in mesh optical networks. IEEE Trans. Commun. 51(3), 489\u2013494 (2003)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"283_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10898-009-9497-9","volume":"48","author":"Z. Liang","year":"2010","unstructured":"Liang Z., Chaovalitwongse W.: Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models. J. Glob. Optim. 48(2), 335\u2013345 (2010)","journal-title":"J. Glob. Optim."},{"issue":"10","key":"283_CR10","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.cor.2009.12.009","volume":"37","author":"Z. Liang","year":"2010","unstructured":"Liang Z., Chaovalitwongse W., Cha M., Moon S.: Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms. Comput. Oper. Res. 37(10), 1731\u20131739 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"283_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00248006","volume":"6","author":"P. Pardalos","year":"1996","unstructured":"Pardalos P., Khoury B.: A heuristic for the Steiner problem on graphs. Comput. Optim. Appl. 6(1), 5\u201314 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"283_CR12","unstructured":"Paul, P., Raghavan, S.V.: Survey of multicast routing algorithms and protocols. In: Proceedings of the Fifteenth International Conference on Computer Communication (ICCC 2002), pp. 902\u2013926 (2002)"},{"issue":"1\u20133","key":"283_CR13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0166-218X(00)00318-8","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin T., Daneshmand S.V.: A comparison of Steiner tree relaxations. Discret. Appl. Math. 112(1\u20133), 241\u2013261 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"283_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin T., Daneshmand S.V.: Improved algorithms for the Steiner problem in networks. Discret. Appl. Math. 112(1\u20133), 263\u2013300 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"283_CR15","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/TNET.2005.852879","volume":"13","author":"L. Shen","year":"2005","unstructured":"Shen L., Yang X., Ramanurthy B.: Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks. IEEE\/ACM Transact. Netw. 13(4), 918\u2013931 (2005)","journal-title":"IEEE\/ACM Transact. Netw."},{"issue":"3","key":"283_CR16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"Wong R.T.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Progr. 28(3), 271\u2013287 (1984)","journal-title":"Math. Progr."},{"issue":"2","key":"283_CR17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.comnet.2004.10.013","volume":"48","author":"S. Yuan","year":"2005","unstructured":"Yuan S., Jue J.P.: Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints. Comput. Netw. 48(2), 91\u2013112 (2005)","journal-title":"Comput. Netw."},{"issue":"2","key":"283_CR18","first-page":"91","volume":"11","author":"H. Zang","year":"2003","unstructured":"Zang H., Ou C., Mukherjee B.: Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints. IEEE\/ACM Transact. Netw. 11(2), 91\u2013112 (2003)","journal-title":"IEEE\/ACM Transact. Netw."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0283-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0283-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0283-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:27Z","timestamp":1559394687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0283-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0283-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,8]]}}}