{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T23:10:21Z","timestamp":1736377821385,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_118","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:27:59Z","timestamp":1147357679000},"page":"1129-1136","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Multicast Tree with Delay and Delay Variation Constraints"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[]},{"given":"Jong S.","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"118_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)"},{"key":"118_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"},{"issue":"6","key":"118_CR3","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":"3","key":"118_CR4","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"},{"issue":"3","key":"118_CR5","first-page":"346","volume":"15","author":"G.N. Rouskas","year":"1997","unstructured":"Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE JSAC\u00a015(3), 346\u2013356 (1997)","journal-title":"IEEE JSAC"},{"key":"118_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/11557654_17","volume-title":"High Performance Computing and Communications","author":"M. Kim","year":"2005","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: On Estimation for Reducing Multicast Delay Variation. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds.) HPCC 2005. LNCS, vol.\u00a03726, pp. 117\u2013122. Springer, Heidelberg (2005)"},{"issue":"8","key":"118_CR7","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/S0140-3664(01)00404-2","volume":"25","author":"P.-R. Sheu","year":"2002","unstructured":"Sheu, P.-R., Chen, S.-T.: A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation-Bounded Multicast Tree Problem. Computer Communications\u00a025(8), 825\u2013833 (2002)","journal-title":"Computer Communications"},{"key":"118_CR8","doi-asserted-by":"crossref","unstructured":"Ballardie, A., Cain, B., Zhang, Z.: Core Based Trees (CBT version 3) Multicast Routing protocol specification, Internet Draft, IETF (August 1998)","DOI":"10.17487\/rfc2201"},{"key":"118_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-25978-7_45","volume-title":"Information Networking. Networking Technologies for Broadband and Mobile Networks","author":"M. Kim","year":"2004","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol.\u00a03090, pp. 440\u2013450. Springer, Heidelberg (2004)"},{"key":"118_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/11424925_103","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"M. Kim","year":"2005","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: On Algorithm for Efficiently Combining Two Independent Measures in Routing Paths. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03483, pp. 989\u2013998. Springer, Heidelberg (2005)"},{"issue":"9","key":"118_CR11","first-page":"1617","volume":"6","author":"B.W. Waxman","year":"1988","unstructured":"Waxman, B.W.: Routing of multipoint connections. IEEE JSAC\u00a06(9), 1617\u20131622 (1988)","journal-title":"IEEE JSAC"},{"key":"118_CR12","unstructured":"Doar, M.: Multicast in the ATM environment, Ph.D dissertation, Cambridge University, Computer Lab. (September 1993)"},{"key":"118_CR13","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":"118_CR14","unstructured":"Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380\u20131387 (1996)"},{"key":"118_CR15","doi-asserted-by":"crossref","unstructured":"Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an Internetwork. In: IEEE Proc. INFOCOM 1996, pp. 594\u2013602 (1996)","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"118_CR16","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":"118_CR17","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":"118_CR18","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)"}],"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_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T22:34:22Z","timestamp":1736375662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11751595_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}