{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:52Z","timestamp":1725550072191},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290315"},{"type":"electronic","value":"9783540320791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_34","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:59:18Z","timestamp":1128434358000},"page":"277-282","source":"Crossref","is-referenced-by-count":3,"title":["On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation"],"prefix":"10.1007","author":[{"given":"Youngjin","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Moonseong","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","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":"34_CR2","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":"34_CR3","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"},{"unstructured":"Sheu, P.-R., Chen, S.-T.: A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem. In: Proc. ICOIN-15 Information Networking, January 2001, pp. 611\u2013618 (2001)","key":"34_CR4"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T12:28:43Z","timestamp":1547900923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/11557654_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}