{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:06:12Z","timestamp":1762916772508},"reference-count":16,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":[[1997,9]]},"DOI":"10.1016\/s0140-3664(97)00081-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"750-758","source":"Crossref","is-referenced-by-count":41,"title":["A group multicast routing algorithm by using multiple minimum Steiner trees"],"prefix":"10.1016","volume":"20","author":[{"given":"Xiaohua","family":"Jia","sequence":"first","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00081-9_BIB1","series-title":"IEEE INFOCOM'93","first-page":"98","article-title":"Routing multipoint connections using virtual paths in an ATM network","author":"Ammar","year":"1993"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","article-title":"Routing to multiple destinations in computer networks","volume":"COM-31","author":"Bharath-Kumar","year":"1983","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"10.1016\/S0140-3664(97)00081-9_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/179606.179654","article-title":"Multicast routing extensions for OSPF","volume":"37","author":"Moy","year":"1994","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S0140-3664(97)00081-9_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","article-title":"Multicast routing in datagram internetworks and extended LANs","volume":"8","author":"Deering","year":"1990","journal-title":"ACM Trans. Comput. Syst."},{"issue":"9","key":"10.1016\/S0140-3664(97)00081-9_BIB5","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 J. Selected Areas Commun."},{"key":"10.1016\/S0140-3664(97)00081-9_BIB6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problems","volume":"22","author":"Hwang","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB8","article-title":"Mechanisms for broadcast and selective broadcast","author":"Wall","year":"1980"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB9_1","unstructured":"L. Wei, D. Estrin, The trade-offs of multicast trees and algorithms, CS Dept, Univ. of South California, Technical Report 93-560."},{"issue":"2","key":"10.1016\/S0140-3664(97)00081-9_BIB10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/90.490746","article-title":"Distributed algorithms for multicast path setup in data networks","volume":"4","author":"Bauer","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB11","series-title":"Proc. of the 10th Symp. on Reliable Distributed Systems","first-page":"188","article-title":"Ordered broadcasts for large applications","author":"Ng","year":"1991"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB12","series-title":"Proc. IEEE 18th Conf. on Local Computer Networks","first-page":"327","article-title":"A load balancing multicast tree approach for groupbased multimedia applications","author":"Ahn","year":"1993"},{"issue":"3","key":"10.1016\/S0140-3664(97)00081-9_BIB13","first-page":"266","article-title":"Directed Steiner tree problem on a graph: models, relaxations and algorithms","volume":"28","author":"Dror","year":"1990","journal-title":"INFOR"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: a survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A dual ascent approach for Steiner tree problems on a directed graphs","volume":"28","author":"Wong","year":"1984","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0140-3664(97)00081-9_BIB16","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000819?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000819?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:24:40Z","timestamp":1555197880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":16,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0140366497000819"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00081-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}