{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T23:10:07Z","timestamp":1736377807409,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_114","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:27:59Z","timestamp":1147357679000},"page":"1090-1099","source":"Crossref","is-referenced-by-count":0,"title":["Multicast \u03c9-Trees Based on Statistical Analysis"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"114_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/3-540-45706-2_102","volume-title":"Euro-Par 2002. Parallel Processing","author":"Y.-C. Bang","year":"2002","unstructured":"Bang, Y.-C., Choo, H.: On multicasting with minimum costs for the Internet topology. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol.\u00a02400, pp. 736\u2013744. Springer, Heidelberg (2002)"},{"issue":"3","key":"114_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","volume":"COMM-31","author":"K. Bharath-Kumar","year":"1983","unstructured":"Bharath-Kumar, K., Jaffe, J.M.: Routing to multiple destinations in computer networks. IEEE Trans. Commun.\u00a0COMM-31(3), 343\u2013351 (1983)","journal-title":"IEEE Trans. Commun."},{"key":"114_CR3","doi-asserted-by":"crossref","unstructured":"Calvert, K.L., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine, 160\u2013163 (June 1997)","DOI":"10.1109\/35.587723"},{"key":"114_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"114_CR5","unstructured":"Doar, M.: Multicast in the ATM environment. PhD thesis, Cambridge Univ., Computer Lab. (September 1993)"},{"key":"114_CR6","doi-asserted-by":"crossref","unstructured":"Doar, M.: A Better Mode for Generating Test Networks. In: IEEE Proc. GLOBECOM 1996, pp. 86\u201393 (1996)","DOI":"10.1109\/GLOCOM.1996.586131"},{"key":"114_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":"114_CR8","doi-asserted-by":"crossref","unstructured":"Gilbert, E.N., Pollak, H.O.: Steiner minimal tree. SIAM J. Appl. Math.\u00a016 (1968)","DOI":"10.1137\/0116001"},{"key":"114_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S.L. Hakimi","year":"1971","unstructured":"Hakimi, S.L.: Steiner\u2019s problem in graphs and its implication. Networks\u00a01, 113\u2013133 (1971)","journal-title":"Networks"},{"issue":"3","key":"114_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.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Networking\u00a01(3), 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"114_CR11","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":"114_CR12","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the Web graph. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 57\u201365 (2000)","DOI":"10.1109\/SFCS.2000.892065"},{"key":"114_CR13","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"A. Papoulis","year":"2002","unstructured":"Papoulis, A., Pillai, S.U.: Probability, Random Variables, and Stochastic Processes, 4th edn. McGraw-Hill, New York (2002)","edition":"4"},{"key":"114_CR14","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 Techn. J.\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Techn. J."},{"issue":"4","key":"114_CR15","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 asymetric links. IEEE\/ACM Transactions on Networking\u00a04(4), 558\u2013568 (1996)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"114_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":"6","key":"114_CR17","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyame, A.: An approximate solution for the steiner problem in graphs. Mathematica Japonica\u00a024(6), 573\u2013577 (1980)","journal-title":"Mathematica Japonica"},{"key":"114_CR18","unstructured":"Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380\u20131387 (1993)"},{"issue":"9","key":"114_CR19","first-page":"1617","volume":"6","author":"B.W. Waxman","year":"1988","unstructured":"Waxman, B.W.: Routing of multipoint connections. IEEE J-SAC\u00a06(9), 1617\u20131622 (1988)","journal-title":"IEEE J-SAC"},{"key":"114_CR20","doi-asserted-by":"crossref","unstructured":"Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an Internetwork. In: Proc. INFOVCOM 1996, pp. 594\u2013602 (1996)","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"114_CR21","unstructured":"Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for near-optimum delay-constrained multicasting. In: Proc. IEEE INFOCOM 1995, March 1995, pp. 377\u2013385 (1995)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_114.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T22:34:25Z","timestamp":1736375665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11751595_114","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}