{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:41:56Z","timestamp":1742953316238,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540795483"},{"type":"electronic","value":"9783540795490"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79549-0_19","type":"book-chapter","created":{"date-parts":[[2008,5,5]],"date-time":"2008-05-05T15:12:23Z","timestamp":1210000343000},"page":"215-226","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Heuristic for Minimum Cost Trees Construction in Multi-Groups Multicast"],"prefix":"10.1007","author":[{"given":"Keen-Mun","family":"Yong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gee-Swee","family":"Poo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tee-Hiang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner Trees. Acta Informatica\u00a015, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Striegel, A., Manimaran, G.: A survey of QoS Multicasting Issues. IEEE Comm. Magazine, 82\u201385 (June 2002)","DOI":"10.1109\/MCOM.2002.1007412"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/90.793020","volume":"7","author":"S. Raghavan","year":"1999","unstructured":"Raghavan, S., Manimaran, G., Murthy, C.S.R.: A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. IEEE\/ACM Transactions on Networking\u00a07(4), 514\u2013529 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/49.564136","volume":"15","author":"F. Bauer","year":"1997","unstructured":"Bauer, F., Verma, A.: ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE J. of Selected Areas in Comm.\u00a015, 382\u2013397 (1997)","journal-title":"IEEE J. of Selected Areas in Comm."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ballardie, A., Francis, P., Crowcroft, J.: Core Based Trees (CBT) and Architecture for Scalable Inter-domain Multicast Routing. In: ACM SIGCOMM 1993, August 1993, pp. 85\u201389 (1993)","DOI":"10.1145\/167954.166246"},{"key":"19_CR7","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 Journal of Selected Areas in Communication\u00a06, 1617\u20131622 (1988)","journal-title":"IEEE Journal of Selected Areas in Communication"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79549-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:22:46Z","timestamp":1557530566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79549-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540795483","9783540795490"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79549-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}