{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T23:32:48Z","timestamp":1699486368292},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":[[1997,6]]},"DOI":"10.1016\/s0305-0548(96)00074-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"521-527","source":"Crossref","is-referenced-by-count":8,"title":["Distributed multicast routing in point-to-point networks"],"prefix":"10.1016","volume":"24","author":[{"given":"Jo\u017ee","family":"Rugelj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00074-3_BIB1","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(96)00074-3_BIB2","first-page":"185","article-title":"A primal-dual approximation algorithm for the Steiner forest problem","volume":"50","author":"Ravi","year":"1994"},{"key":"10.1016\/S0305-0548(96)00074-3_BIB3","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0305-0548(96)00074-3_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 Inform."},{"key":"10.1016\/S0305-0548(96)00074-3_BIB5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","article-title":"The computation of nearly minimal Steiner trees in graphs","volume":"14","author":"Rayward-Smith","year":"1983","journal-title":"Int. J. Math. Ed. Sci. Tech."},{"key":"10.1016\/S0305-0548(96)00074-3_BIB6","series-title":"Proc. 3rd IFIP Conf. on High Speed Networking","first-page":"201","article-title":"Path finding algorithm for broadband multicast","author":"Jiang","year":"1991"},{"key":"10.1016\/S0305-0548(96)00074-3_BIB7","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/0214062","article-title":"Distributed multidestination routing: the constraints of local information","volume":"14","author":"Jaffe","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0305-0548(96)00074-3_BIB8","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Math. Japon."},{"key":"10.1016\/S0305-0548(96)00074-3_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 System Tech. J."},{"key":"10.1016\/S0305-0548(96)00074-3_BIB10","series-title":"Proc. 3rd IEE Int. Conf. on Software Eng. for Real Time Systems","first-page":"271","article-title":"Multicast real-time communications","author":"Rugelj","year":"1991"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000743?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000743?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:09Z","timestamp":1555204869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0305054896000743"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00074-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}