{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:10Z","timestamp":1761611230159},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_27","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"286-295","source":"Crossref","is-referenced-by-count":8,"title":["An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem"],"prefix":"10.1007","author":[{"given":"Zhipeng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Cai, Z.: Improved algorithms for multicast routing and binary fingerprint vector clustering. Master\u2019s thesis, Department of Computing Science, University of Alberta (June 16, 2004)"},{"key":"27_CR2","unstructured":"Cai, Z., Chen, Z.-Z., Lin, G.-H., Wang, L.: An improved approximation algorithm for the capacitated multicast tree routing problem. Technical Report TR08-06, Department of Computing Science, University of Alberta (May 2008)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11533719_16","volume-title":"Computing and Combinatorics","author":"Z. Cai","year":"2005","unstructured":"Cai, Z., Lin, G.-H., Xue, G.L.: Improved approximation algorithms for the capacitated multicast routing problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 136\u2013145. Springer, Heidelberg (2005)"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-1-4613-0255-1_7","volume-title":"Steiner Trees in Industries","author":"C. Gr\u00f6pl","year":"2001","unstructured":"Gr\u00f6pl, C., Hougardy, S., Nierhoff, T., Pr\u00f6mel, H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 235\u2013279. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2003.12.019","volume":"314","author":"J. Gu","year":"2004","unstructured":"Gu, J., Hu, X.D., Jia, X., Zhang, M.-H.: Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science\u00a0314, 293\u2013301 (2004)","journal-title":"Theoretical Computer Science"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(02)00220-X","volume":"84","author":"J. Gu","year":"2002","unstructured":"Gu, J., Hu, X.D., Zhang, M.-H.: Algorithms for multicast connection under multi-path routing model. Information Processing Letters\u00a084, 31\u201339 (2002)","journal-title":"Information Processing Letters"},{"key":"27_CR7","unstructured":"Hadas, R.L.: Efficient collective communication in WDM networks. In: Proceedings of IEEE ICCCN 2000, pp. 612\u2013616 (2000)"},{"key":"27_CR8","volume-title":"Routing in the Internet","author":"C. Huitema","year":"2000","unstructured":"Huitema, C.: Routing in the Internet. Prentice Hall PTR, Englewood Cliffs (2000)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/1103963.1103967","volume":"1","author":"R. Jothi","year":"2005","unstructured":"Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Transactions on Algorithms\u00a01, 265\u2013282 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"27_CR10","volume-title":"Multimedia Communications: Protocols and Applications","author":"F. Kuo","year":"1998","unstructured":"Kuo, F., Effelsberg, W., Garcia-Luna-Aceves, J.J.: Multimedia Communications: Protocols and Applications. Prentice Hall, Inc., Englewood Cliffs (1998)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10878-005-1776-x","volume":"9","author":"G.-H. Lin","year":"2005","unstructured":"Lin, G.-H.: An improved approximation algorithm for multicast k-tree routing. Journal of Combinatorial Optimization\u00a09, 349\u2013356 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2007.10.021","volume":"390","author":"E. Morsy","year":"2008","unstructured":"Morsy, E., Nagamochi, H.: An improved approximation algorithm for capacitated multicast routings in networks. Theoretical Computer Science\u00a0390, 81\u201391 (2008)","journal-title":"Theoretical Computer Science"},{"key":"27_CR13","unstructured":"Robins, G., Zelikovsky, A.Z.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770\u2013779 (2000)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications\u00a014, 1228\u20131234 (1996)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"27_CR15","unstructured":"Zhang, X., Wei, J., Qiao, C.: Constrained multicast routing in WDM networks with sparse light splitting. In: Proceedings of IEEE INFOCOM 2000, March 26\u201330, pp. 1781\u20131790 (2000)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:01Z","timestamp":1619523661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}