{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:16Z","timestamp":1725564736685},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219934"},{"type":"electronic","value":"9783540246800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24680-0_159","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T18:50:22Z","timestamp":1283971822000},"page":"1022-1025","source":"Crossref","is-referenced-by-count":1,"title":["A Multicast Routing Algorithm for CSCW"],"prefix":"10.1007","author":[{"given":"Xiongfei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dandan","family":"Huan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanfang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"159_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner Problem in graphs. Networks\u00a01(3), 195\u2013207 (1971)","journal-title":"Networks"},{"key":"159_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M.L. Garey","year":"1979","unstructured":"Garey, M.L., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. W H Freeman, San Francisco (1979)"},{"issue":"2","key":"159_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in networks: A survey. Networks\u00a017(2), 129\u2013167 (1987)","journal-title":"Networks"},{"key":"159_CR4","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B. Waxman","year":"1988","unstructured":"Waxman, B.: Routing of multipoint connections. IEEE J. Select. Areas Commun.\u00a06, 1617\u20131622 (1988)","journal-title":"IEEE J. Select. Areas Commun."},{"key":"159_CR5","unstructured":"Lin, H., Lai, S.: VTDM-A dynamic multicast routing algorithm. In: Proc. of IEEE INFOCOM 1998, San Francisco, California, USA, March 31-April 2, pp. 1426\u20131432 (1998)"},{"issue":"3","key":"159_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.: Dynamic Steiner Tree Problems. SIAM J. Disc. Math.\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM J. Disc. Math."},{"key":"159_CR7","doi-asserted-by":"crossref","unstructured":"Kadirire, J., Knight, G.: Comparison of Dynamic Multicast Routing Algorithm for Wide-area Packet Switched (Asynchronous Transfer Mode) Networks. In: Proc. of IEEE INFOCOM, April 1995, pp. 212\u2013219 (1995)","DOI":"10.1109\/INFCOM.1995.515879"},{"issue":"3","key":"159_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/49.564136","volume":"15","author":"F. Bauer","year":"1999","unstructured":"Bauer, F., Varma, A.: ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. IEEE J. Select. Areas Commun.\u00a015(3), 382\u2013397 (1999)","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"4","key":"159_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/90.793020","volume":"7","author":"S. Raghavan","year":"1999","unstructured":"Raghavan, S., Manimaran, G., Siva Ram Murthy, C.: A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. IEEE\/ACM Trans. Networking\u00a07(4), 514\u2013529 (1999)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"3","key":"159_CR10","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multimedia Routing for Multimedia Communication[J]. IEEE\/ACM Trans. Networking\u00a01(3), 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Networking"}],"container-title":["Lecture Notes in Computer Science","Grid and Cooperative Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24680-0_159.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:02:17Z","timestamp":1619996537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24680-0_159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219934","9783540246800"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24680-0_159","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}