{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:37Z","timestamp":1759847797504,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540393689"},{"type":"electronic","value":"9783540393726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847366_46","type":"book-chapter","created":{"date-parts":[[2006,9,8]],"date-time":"2006-09-08T20:50:18Z","timestamp":1157748618000},"page":"447-456","source":"Crossref","is-referenced-by-count":2,"title":["On Multicasting Steiner Trees for 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":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","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":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/11557654_4","volume-title":"High Performance Computing and Communications","author":"Y.-C. Bang","year":"2005","unstructured":"Bang, Y.-C., Chung, S.-T., Kim, M., Joo, S.-S.: On Multicast Communications with Minimum Resources. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds.) HPCC 2005. LNCS, vol.\u00a03726, pp. 4\u201313. Springer, Heidelberg (2005)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Calvert, K.L., Doar, M., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine, 160\u2013163 (June 1997)","DOI":"10.1109\/35.587723"},{"key":"46_CR4","unstructured":"Doar, M.: Multicast in the ATM environment, Ph.D dissertation, Cambridge University, Computer Lab. (September 1993)"},{"key":"46_CR5","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":"46_CR6","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":"46_CR7","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"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/11573036_77","volume-title":"Advances in Informatics","author":"G. Jho","year":"2005","unstructured":"Jho, G., Kim, M., Choo, H.: Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost. In: Bozanis, P., Houstis, E.N. (eds.) PCI 2005. LNCS, vol.\u00a03746, pp. 808\u2013819. Springer, Heidelberg (2005)"},{"key":"46_CR9","first-page":"85","volume-title":"Complexity of computer computations","author":"R.M. Karp","year":"1970","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thather, J.W. (eds.) Complexity of computer computations, pp. 85\u2013104. Plenum Press, New York (1970)"},{"key":"46_CR10","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":"46_CR11","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)"},{"key":"46_CR12","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)"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/11751595_118","volume-title":"Computational Science and Its Applications - ICCSA 2006","author":"M. Kim","year":"2006","unstructured":"Kim, M., Bang, Y.-C., Yang, J.S., Choo, H.: An Efficient Multicast Tree with Delay and Delay Variation Constraints. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Lagan\u00e1, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol.\u00a03982, pp. 1129\u20131136. Springer, Heidelberg (2006)"},{"key":"46_CR14","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":"46_CR15","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":"46_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":"46_CR17","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 J-SAC\u00a015(3), 346\u2013356 (1997)","journal-title":"IEEE J-SAC"},{"issue":"8","key":"46_CR18","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"},{"issue":"6","key":"46_CR19","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"},{"key":"46_CR20","unstructured":"Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380\u20131387 (1996)"},{"issue":"1","key":"46_CR21","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":"46_CR22","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":"46_CR23","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"},{"key":"46_CR24","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"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847366_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:12:16Z","timestamp":1736539936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847366_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540393689","9783540393726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11847366_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}