{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:02Z","timestamp":1761611162413},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10878-005-1776-x","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T10:09:50Z","timestamp":1124532590000},"page":"349-356","source":"Crossref","is-referenced-by-count":11,"title":["An Improved Approximation Algorithm for Multicast k-Tree Routing"],"prefix":"10.1007","volume":"9","author":[{"given":"Guohui","family":"Lin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1776_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979."},{"key":"1776_CR2","doi-asserted-by":"crossref","unstructured":"C. Gr\u00f6pl, S. Hougardy, T. Nierhoff, and H.J. Pr\u00f6mel, \u201cApproximation algorithms for the Steiner tree problem in graphs,\u201d In D.-Z. Du and X. Cheng (Eds.), Steiner Trees in Industries, Kluwer Academic Publishers, 2001, pp. 235\u2013279.","DOI":"10.1007\/978-1-4613-0255-1_7"},{"key":"1776_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0020-0190(02)00220-X","volume":"84","author":"J. Gu","year":"2002","unstructured":"J. Gu, X.D. Hu, and M.H. Zhang, \u201cAlgorithms for multicast connection under multi-path routing model,\u201d Information Processing Letters, vol. 84, pp. 31\u201339, 2002.","journal-title":"Information Processing Letters"},{"key":"1776_CR4","unstructured":"R.L. Hadas. \u201cEfficient collective communication in WDM networks,\u201d in Proceedings of IEEE ICCCN 2000, 2000, pp. 612\u2013616."},{"key":"1776_CR5","unstructured":"X.-D. Hu, T.-P. Shuai, X. Jia, and M. H. Zhang, \u201cMulticast routing and wavelength assignment in WDM networks with limited drop-offs,\u201d In Proceedings of IEEE INFOCOM 2004, 2004."},{"key":"1776_CR6","unstructured":"C. Huitema, Routing in the Internet. Prentice Hall PTR, 2000."},{"key":"1776_CR7","unstructured":"F. Kuo, W. Effelsberg, and J.J. Garcia-Luna-Aceves, Multimedia Communications: Protocols and Applications. Prentice Hall, Inc., 1998."},{"key":"1776_CR8","unstructured":"G. Robins and A. Zelikovsky, \u201cImproved Steiner tree approximation in graphs,\u201d in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), 2000, pp. 770\u2013779."},{"key":"1776_CR9","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1996","unstructured":"A.S. Tanenbaum, Computer Networks. Prentice Hall PTR, Upper Saddle River, NJ, 1996."},{"key":"1776_CR10","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Z. Wang and J. Crowcroft, \u201cQuality-of-service routing for supporting multimedia applications,\u201d IEEE Journal on Selected Areas in Communications, vol. 14, pp. 1228\u20131234, 1996.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1776_CR11","unstructured":"X. Zhang, J. Wei, and C. Qiao, \u201cConstrained multicast routing in WDM networks with sparse light splitting,\u201d in Proceedings of IEEE INFOCOM 2000, March 26\u201330, 2000, pp. 1781\u20131790."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1776-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1776-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1776-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:08Z","timestamp":1559276288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1776-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["1776"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1776-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}