{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T05:09:56Z","timestamp":1744348196772},"reference-count":12,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0140-3664(01)00404-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:03:16Z","timestamp":1027612996000},"page":"825-833","source":"Crossref","is-referenced-by-count":48,"title":["A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem"],"prefix":"10.1016","volume":"25","author":[{"given":"Pi-Rong","family":"Sheu","sequence":"first","affiliation":[]},{"given":"Shan-Tai","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(01)00404-2_BIB1","doi-asserted-by":"crossref","unstructured":"A. Ballardie, Core based tree (CBT) multicast routing architecture, Internet RFC 2201, Sept. 1996.","DOI":"10.17487\/rfc2201"},{"key":"10.1016\/S0140-3664(01)00404-2_BIB2","unstructured":"S.T. Chen, A Study on multicast routing with delay variation constraints, Master Thesis, Department of Electrical Engineering, National Yunlin University of Science and Technology, Taiwan, ROC, June 1998."},{"key":"10.1016\/S0140-3664(01)00404-2_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0140-3664(01)00404-2_BIB4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problem in graphs and its implications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0140-3664(01)00404-2_BIB5","first-page":"343","article-title":"Routing to multiple destinations in computer networks","volume":"COM-31","author":"Kadaba","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0140-3664(01)00404-2_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0140-3664(01)00404-2_BIB7","series-title":"IP Multicasting: The Complete Guide to Interactive Corporate Networks","author":"Kosiur","year":"1998"},{"key":"10.1016\/S0140-3664(01)00404-2_BIB8","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 Inform."},{"key":"10.1016\/S0140-3664(01)00404-2_BIB9","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"10.1016\/S0140-3664(01)00404-2_BIB10","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/49.564133","article-title":"Multicast routing with end-to-end delay and delay variation constraints","volume":"15","author":"Rouskas","year":"1997","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S0140-3664(01)00404-2_BIB11","unstructured":"P.R. Sheu, S.T. Chen, On the hardness of approximating the delay variation constraint multicast trees, Proceedings of the 1999 National Computer Symposium, Taipei, Taiwan, ROC, pp. A-351\u2013A-358."},{"issue":"9","key":"10.1016\/S0140-3664(01)00404-2_BIB12","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. Select. Areas Commun."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401004042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401004042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:50:51Z","timestamp":1578700251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366401004042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0140366401004042"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(01)00404-2","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}