{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:18Z","timestamp":1725550458344},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_77","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T06:06:19Z","timestamp":1130133979000},"page":"808-819","source":"Crossref","is-referenced-by-count":1,"title":["Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost"],"prefix":"10.1007","author":[{"given":"Gunu","family":"Jho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moonseong","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"77_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/90.490746","volume":"4","author":"F. Bauer","year":"1996","unstructured":"Bauer, F., Varma, A.: Distributed Algorithms for Multicast Path Setup in Data Networks. IEEE\/ACM Transactions on Networking\u00a04(2), 181\u2013191 (1996)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"77_CR2","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/49.564136","volume":"15","author":"F. Bauer","year":"1997","unstructured":"Bauer, F., Varma, A.: ARIES: A rearrangeable inexpensive edge-based on-line Steiner Algorithm. IEEE Journal on Selected Areas in Communications, vol\u00a015(3), 382\u2013397 (1997)","journal-title":"IEEE Journal on Selected Areas in Communications, vol"},{"key":"77_CR3","volume-title":"Data Networks","author":"D. Bertsckas","year":"1992","unstructured":"Bertsckas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)"},{"key":"77_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"77_CR5","doi-asserted-by":"crossref","unstructured":"Doar, M., Leslie, I.: How bad is naive multicast routing. In: Proceedings of the IEEE INFOCOM, pp. 82\u201389 (1993)","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"77_CR6","first-page":"227","volume-title":"Encyclopedia of optimization","author":"D.Z. Du","year":"2001","unstructured":"Du, D.Z., Lu, B., Ngo, H., Pardalos, P.M.: Steiner Tree Problems. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of optimization, vol.\u00a05, pp. 227\u2013290. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"77_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)"},{"key":"77_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.: Steiner Tree Problems. Networks\u00a022, 55\u201389 (1992)","journal-title":"Networks"},{"issue":"3","key":"77_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","volume":"31","author":"B.K. Kadaba","year":"1983","unstructured":"Kadaba, B.K., Jaffe, J.M.: Routing to Multiple Destinations in Computer Networks. IEEE Transactions on Communications, COM-31\u00a031(3), 343\u2013351 (1983)","journal-title":"IEEE Transactions on Communications, COM-31"},{"key":"77_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thather, J.W. (eds.) Complexity of computer computations, pp. 85\u2013104. Newyork Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"77_CR11","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.: Multicast Routing for Multimedia Communications. IEEE\/ACM Transactions on Networking\u00a01(3), 286\u2013292 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"77_CR12","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":"77_CR13","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Tech.J.\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Tech.J."},{"issue":"4","key":"77_CR14","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/90.532865","volume":"4","author":"S. Ramanathan","year":"1996","unstructured":"Ramanathan, S.: Multicast Tree Generation in Networks with Asymmetric Links. IEEE\/ACM Transactions on Networking\u00a04(4), 558\u2013568 (1996)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"77_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/3-540-44862-4_95","volume-title":"Computational Science \u2013 ICCS 2003","author":"A.S. Rodionov","year":"2003","unstructured":"Rodionov, A.S., Choo, H.: On generating random network structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02658, pp. 879\u2013887. Springer, Heidelberg (2003)"},{"key":"77_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-25978-7_49","volume-title":"Information Networking. Networking Technologies for Broadband and Mobile Networks","author":"A.S. Rodionov","year":"2004","unstructured":"Rodionov, A.S., Choo, H.: On generating random network structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol.\u00a03090, pp. 483\u2013491. Springer, Heidelberg (2004)"},{"issue":"3","key":"77_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"Rayward-Smith, V.J.: A Clare, On finding Steiner vertices. Networks\u00a016(3), 283\u2013294 (1986)","journal-title":"Networks"},{"issue":"6","key":"77_CR18","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica\u00a024(6), 573\u2013577 (1980)","journal-title":"Mathematica Japonica"},{"issue":"1","key":"77_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/65.819168","volume":"14","author":"B. Wang","year":"2000","unstructured":"Wang, B., Hou, J.C.: Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols. IEEE Network\u00a014(1), 22\u201336 (2000)","journal-title":"IEEE Network"},{"issue":"9","key":"77_CR20","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications\u00a06(9), 1617\u20131622 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"77_CR21","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, 129\u2013167 (1987)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:41:08Z","timestamp":1619491268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11573036_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}