{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:11:41Z","timestamp":1742393501359},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675068"},{"type":"electronic","value":"9783540455516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45551-5_19","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:27:09Z","timestamp":1185935229000},"page":"213-227","source":"Crossref","is-referenced-by-count":4,"title":["On Finding Feasible Solutions to the Group Multicast Routing Problem"],"prefix":"10.1007","author":[{"given":"Ning","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chor Ping","family":"Low","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ballardie T, Francis P., Crowcroft J., \u201cCore Based Trees (CBT)\u201d, Proc. SIGCOMM\u2019 93 Conf., ACM, (1993) 85\u201395.","DOI":"10.1145\/166237.166246"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/90.490746","volume":"4","author":"F. Bauer","year":"1996","unstructured":"F. Bauer. A. Varma. \u201cDistributed algorithms for multicast path setup in data networks\u201d, IEEE\/ACM Trans. Networking 4(2), (1996) 181\u2013191.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"19_CR3","unstructured":"Dirceu Cavendish, Aiguo Fei, Mario Gerla and Raphael Rom, \u201cOn the construction of low cost Multicast Trees with Bandwidth Reservation\u201d, UCLA Technical Report, Doc ID: ncstrl.ucla_cs\/970043."},{"key":"19_CR4","volume-title":"Computers and Intractability\u2014a Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson, \u201cComputers and Intractability\u2014a Guide to the Theory of NP-completeness\u201d, Freeman, New York, 1979."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","volume":"20","author":"X. Jia","year":"1997","unstructured":"X. Jia and L. Wang, \u201cGroup multicast routing algorithm by using multiple minimum Steiner trees\u201d, Computer Communications 20, (1997) 750\u2013758.","journal-title":"Computer Communications"},{"key":"19_CR6","doi-asserted-by":"crossref","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":"R. M. Karp, \u201cReducibility among Combinatorial Problems\u201d in Miller and Thatcher (Eds.), complexity of Computer Computations, Plenum Press. New York, 1972, 85\u2013103."},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V. P. Kompella","year":"1993","unstructured":"V. P. Kompella, J. C. Pasquale, G. C. Polyzos. \u201cMulticast routing for multimedia communication\u201d, IEEE\/ACM Tran. On Networking 1(3), (June 1993) 286\u2013292.","journal-title":"IEEE\/ACM Tran. On Networking"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky and L. Berman, \u201cA fast algorithm for Steiner trees\u201d, Acta Informatica 15, (1981) 141\u2013145.","journal-title":"Acta Informatica"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"C. P. Low, N. Wang \u201cAn efficient algorithm for group multicast routing with bandwidth reservation\u201d, Proc. IEEE International conf. on networks (ICON\u201999).","DOI":"10.1016\/S0140-3664(00)00222-X"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"V.J. Rayward-Smith and A. Clare, \u201cOn Finding Steiner Vertices\u201d, Networks, Vol. 16, no. 3, (1986), 283\u2013294.","journal-title":"Networks"},{"key":"19_CR11","first-page":"573","volume":"6","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyama, \u201cAn approximate solution for the Steiner problem in graphs\u201d, Math. Japonica 6, (1980) 573\u2013577.","journal-title":"Math. Japonica"},{"issue":"9","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B. M. Waxman","year":"1988","unstructured":"B. M. Waxman, \u201cRouting of multipoint connections\u201d, IEEE J. Selected Areas Commun. 6(9) (1988) 1617\u20131622.","journal-title":"IEEE J. Selected Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45551-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:31:32Z","timestamp":1556728292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45551-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675068","9783540455516"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45551-5_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}