{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:29:13Z","timestamp":1760596153648},"reference-count":7,"publisher":"Elsevier BV","issue":"18","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0140-3664(00)00222-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:56:47Z","timestamp":1027630607000},"page":"1740-1746","source":"Crossref","is-referenced-by-count":17,"title":["An efficient algorithm for group multicast routing with bandwidth reservation"],"prefix":"10.1016","volume":"23","author":[{"given":"C.P","family":"Low","sequence":"first","affiliation":[]},{"given":"N","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(00)00222-X_BIB1","doi-asserted-by":"crossref","unstructured":"T. Ballardie, P. Francis, J. Crowcroft, Core based trees (CBT), Proc. SIGCOMM'93 Conf., ACM, 1993, pp. 85\u201395.","DOI":"10.1145\/166237.166246"},{"key":"10.1016\/S0140-3664(00)00222-X_BIB2","series-title":"Computers and Intractability\u2014a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0140-3664(00)00222-X_BIB3","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","article-title":"Group multicast routing algorithm by using multiple minimum Steiner trees","volume":"20","author":"Jia","year":"1997","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(00)00222-X_BIB4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatica"},{"issue":"3","key":"10.1016\/S0140-3664(00)00222-X_BIB5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/net.3230160305","article-title":"On finding Steiner vertices","volume":"16","author":"Rayward-Smith","year":"1986","journal-title":"Networks"},{"key":"10.1016\/S0140-3664(00)00222-X_BIB6","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"6","author":"Takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"issue":"9","key":"10.1016\/S0140-3664(00)00222-X_BIB7","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S014036640000222X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S014036640000222X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T22:58:01Z","timestamp":1555801081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S014036640000222X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":7,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S014036640000222X"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(00)00222-x","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}