{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:25:38Z","timestamp":1648729538539},"reference-count":15,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":["Information Sciences"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0020-0255(97)10049-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T20:00:31Z","timestamp":1049486431000},"page":"217-232","source":"Crossref","is-referenced-by-count":0,"title":["Group channel routing for conferencing systems in wide area networks"],"prefix":"10.1016","volume":"107","author":[{"given":"Xiaohua","family":"Jia","sequence":"first","affiliation":[]},{"given":"Kia","family":"Makki","sequence":"additional","affiliation":[]},{"given":"Niki","family":"Pissinou","sequence":"additional","affiliation":[]},{"given":"Weijia","family":"Jia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(97)10049-4_BIB1","first-page":"98","article-title":"Routing Multipoint Connections Using Virtual Paths in an ATM network","author":"Ammar","year":"1993","journal-title":"IEEE INFOCOM'93"},{"key":"10.1016\/S0020-0255(97)10049-4_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":"2","key":"10.1016\/S0020-0255(97)10049-4_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","article-title":"Multicast routing in datagram internetworks and entended LANs","volume":"8","author":"Deering","year":"1990","journal-title":"ACM Trans. Comput. Systems"},{"issue":"8","key":"10.1016\/S0020-0255(97)10049-4_BIB4","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":"Commun. ACM"},{"issue":"5","key":"10.1016\/S0020-0255(97)10049-4_BIB5","article-title":"Efficient solutions to multicast routing in communication networks","volume":"2","author":"Makki","year":"1996","journal-title":"Mobile Networks and Applications"},{"issue":"9","key":"10.1016\/S0020-0255(97)10049-4_BIB6","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 in Commun."},{"key":"10.1016\/S0020-0255(97)10049-4_BIB7","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\/S0020-0255(97)10049-4_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/S0020-0255(97)10049-4_BIB9","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\/S0020-0255(97)10049-4_BIB10","series-title":"Proceedings of the 10th Symposium on Reliable Distributed Systems","first-page":"188","article-title":"Ordered broadcasts for large applications","author":"Ng","year":"1991"},{"key":"10.1016\/S0020-0255(97)10049-4_BIB11","series-title":"Proceedings of the IEEE 18th Conference on Local Computer Networks","first-page":"327","article-title":"A load balancing multicast tree approach for group-based multimedia applications","author":"Alm","year":"1993"},{"issue":"3","key":"10.1016\/S0020-0255(97)10049-4_BIB12","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\/S0020-0255(97)10049-4_BIB13","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\/S0020-0255(97)10049-4_BIB14","doi-asserted-by":"crossref","first-page":"187","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":"Math. Progr."},{"key":"10.1016\/S0020-0255(97)10049-4_BIB15","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025597100494?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025597100494?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T06:26:29Z","timestamp":1556259989000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025597100494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0020025597100494"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(97)10049-4","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}