{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:29:31Z","timestamp":1729654171159,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/glocom.2005.1577363","type":"proceedings-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T11:24:16Z","timestamp":1138188256000},"page":"6 pp.-115","source":"Crossref","is-referenced-by-count":4,"title":["Survivable low-cost low-delay multicast trees"],"prefix":"10.1109","author":[{"given":"V.S.","family":"Irava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Hauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/90.650138"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"11","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/ICC.2001.937328","article-title":"A dual-tree scheme for fault-tolerant multicast","volume":"3","author":"fei","year":"2001","journal-title":"Proceedings of IEEE International Conference on Communications"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2003.819550"},{"key":"3","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"takahashi","year":"1980","journal-title":"Math Japonica"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"1"},{"journal-title":"Flows in Networks","year":"1962","author":"ford jr","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/RTTAS.1999.777674"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/49.564135"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/49.564133"},{"key":"4","first-page":"770","article-title":"Improved Steiner tree approximation in graphs","author":"robins","year":"2000","journal-title":"SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms"},{"journal-title":"Survivable Networks Algorithms for Diverse Routing","year":"1999","author":"bhandari","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"}],"event":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","start":{"date-parts":[[2005,12,2]]},"location":"St. Louis, MO, USA","end":{"date-parts":[[2005,12,2]]}},"container-title":["GLOBECOM '05. IEEE Global Telecommunications Conference, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10511\/33285\/01577363.pdf?arnumber=1577363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T11:22:42Z","timestamp":1555413762000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1577363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/glocom.2005.1577363","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}