{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:04:29Z","timestamp":1761401069293,"version":"3.30.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00092-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"905-924","source":"Crossref","is-referenced-by-count":32,"title":["Heuristic algorithms for packing of multiple-group multicasting"],"prefix":"10.1016","volume":"29","author":[{"given":"Chu-Fu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Chun-Teng","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Rong-Hong","family":"Jan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1979","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","key":"10.1016\/S0305-0548(00)00092-7_BIB1"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Drefus","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB3","first-page":"1477","article-title":"Algorithm for the shortest connection of a group of graph vertices","volume":"12","author":"Levin","year":"1971","journal-title":"Soviet Mathematics Dokl"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230120309","article-title":"An algorithm for the Steiner problem in graphs","volume":"12","author":"Shore","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB5","unstructured":"Yang YY, Wing O. An algorithm for the wiring problem. Digest of the IEEE International Symposium on Electrical Networks, 1971. p. 14\u20135."},{"key":"10.1016\/S0305-0548(00)00092-7_BIB6","unstructured":"Foulds LR, Gibbons PB. A branch and bound approach to the Steiner problem in graphs. Proceedings of the 14th Annual Conference of the Operational Research Society of New Zealand, vol. 1, 1978. p. 61\u201370."},{"key":"10.1016\/S0305-0548(00)00092-7_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problem in graphs and it's implications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230170107","article-title":"Problem reduction methods and a tree generation algorithm for the Steiner network problem","volume":"17","author":"Balakrishnan","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB9","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\/S0305-0548(00)00092-7_BIB10","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1002\/net.3230200606","article-title":"A lower bound for the Steiner tree problem in directed graphs","volume":"20","author":"Liu","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","article-title":"An algorithm for the Steiner problem in graphs","volume":"14","author":"Beasley","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_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\/S0305-0548(00)00092-7_BIB13","doi-asserted-by":"crossref","unstructured":"Shaikh A, Lu S, Shin K. Localized multicast routing. Proceedings of Globecom\u201995, 1996. p. 1352\u20136.","DOI":"10.1109\/GLOCOM.1995.502623"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB14","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01758765","article-title":"Path-distance heuristics for the Steiner problem in undirected networks","volume":"7","author":"Winter","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB17","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\/S0305-0548(00)00092-7_BIB18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(91)90096-Z","article-title":"A note on a faster approximation algorithm for the Steiner problem in graphs","volume":"38","author":"Floren","year":"1991","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problem","volume":"22","author":"Hwang","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB20","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\/S0305-0548(00)00092-7_BIB21","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/90.748092","article-title":"A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks","volume":"6","author":"Jia","year":"1998","journal-title":"IEEE\/ACM Transaction on Networking"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB22","unstructured":"Zhu Q, Parsa M, Garcia-Luna-Aceves JJ. A source-based algorithm for delay-constrained minimum-cost multicasting. Proceedings of IEEE Infocom\u201995, 1995. p. 377\u201385."},{"key":"10.1016\/S0305-0548(00)00092-7_BIB23","unstructured":"Chung CJ, Hong SP, Huh HS. A fast multicast routing algorithm for delay-sensitive applications, Proceedings of Globecom\u201997, 1997. p. 1898\u2013902."},{"key":"10.1016\/S0305-0548(00)00092-7_BIB24","doi-asserted-by":"crossref","unstructured":"Bauer F, Varma A. Degree-constrained multicasting in point-to-point networks. Proceedings of IEEE Infocom\u201995, 1995. p. 369\u201376.","DOI":"10.1109\/INFCOM.1995.515897"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB25","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0305-0548(98)00075-6","article-title":"Optimum multicast of multimedia streams","volume":"26","author":"Wang","year":"1999","journal-title":"Computer & Operations Research"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB26","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","article-title":"A group multicast routing algorithm by using multiple minimum Steiner trees","volume":"20","author":"Jia","year":"1997","journal-title":"Computer Communications"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB27","first-page":"720","article-title":"The multicast tree based routing for the complete broadcast multipoint-to-multipoint communications","volume":"E78-B","author":"Priwan","year":"1995","journal-title":"IEICE Transactions of the Communications"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB28","unstructured":"Chen SW, Gunluk O, Yener, B. Optimal packing of group multicastings. Proceedings of IEEE Infocom\u201998, 1995. p. 369\u201376."},{"key":"10.1016\/S0305-0548(00)00092-7_BIB29","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0305-0548(00)00092-7_BIB30","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":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T23:39:20Z","timestamp":1733269160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000927"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00092-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}