{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:08:31Z","timestamp":1743156511007,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230342"},{"type":"electronic","value":"9783540259787"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25978-7_45","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T20:45:17Z","timestamp":1294519517000},"page":"440-450","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","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"},{"doi-asserted-by":"crossref","unstructured":"Gilbert, E.N., Pollak, H.O.: Steiner minimal tree. SIAM J. Appl. Math.\u00a016 (1968)","key":"45_CR2","DOI":"10.1137\/0116001"},{"key":"45_CR3","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":"4","key":"45_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing steiner minimal trees. SIAM J. Appl. Math.\u00a032(4), 835\u2013859 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"6","key":"45_CR5","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":"45_CR6","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":"3","key":"45_CR7","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."},{"issue":"9","key":"45_CR8","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"},{"issue":"4","key":"45_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/167954.166246","volume":"23","author":"T. Ballardie","year":"1993","unstructured":"Ballardie, T., Francis, P., Crowcroft, J.: Core based trees (CBT): An architecture for scalable inter-domain multicast routing. Computer Commun. Rev.\u00a023(4), 85\u201395 (1993)","journal-title":"Computer Commun. Rev."},{"issue":"3","key":"45_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"},{"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)","key":"45_CR11"},{"issue":"3","key":"45_CR12","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"},{"doi-asserted-by":"crossref","unstructured":"Gilbert, E.N., Pollak, H.O.: Steiner minimal tree. SIAM J. Appl. Math.\u00a016 (1968)","key":"45_CR13","DOI":"10.1137\/0116001"},{"key":"45_CR14","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":"45_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)"}],"container-title":["Lecture Notes in Computer Science","Information Networking. Networking Technologies for Broadband and Mobile Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25978-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:21:42Z","timestamp":1676575302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-25978-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230342","9783540259787"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25978-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}