{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:44:39Z","timestamp":1649061879201},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"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,12]]},"DOI":"10.1007\/s10878-005-4925-3","type":"journal-article","created":{"date-parts":[[2005,11,16]],"date-time":"2005-11-16T10:33:08Z","timestamp":1132137188000},"page":"391-394","source":"Crossref","is-referenced-by-count":2,"title":["An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes"],"prefix":"10.1007","volume":"10","author":[{"given":"Longjiang","family":"Guo","sequence":"first","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"My","family":"Thai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4925_CR1","unstructured":"N. Christofides, \u201cWorst-case analysis of a new heuristic for the traveling salesman problem,\u201d Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976."},{"key":"4925_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10878-005-2273-y","volume":"10","author":"H. Du","year":"2005","unstructured":"H. Du, X. Jia, F. Wang, M. Thai, and Y. Li, \u201cA note on optical network with nonsplitting nodes,\u201d Journal of Combinatorial Optimization, vol. 10, pp. 199\u2013202, 2005.","journal-title":"Journal of Combinatorial Optimization"},{"key":"4925_CR3","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:, New York, 1979."},{"key":"4925_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinski","year":"1997","unstructured":"M. Karpinski and A. Zelikovsky, \u201cNew approximation algorithms for the Steiner tree problems,\u201d Journal of Combinatorial Optimization, vol. 1, pp. 47\u201365, 1997.","journal-title":"Journal of Combinatorial Optimization"},{"key":"4925_CR5","unstructured":"Gabriel Robins and Alexander Zelikovsky, \u201cImproved Steiner tree approximation in graphs,\u201d in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 770\u2013779, 2000."},{"issue":"1","key":"4925_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1389-1286(02)00345-6","volume":"41","author":"S. Yan","year":"2003","unstructured":"S. Yan, J.S. Deogun, and M. Ali, \u201cRouting in sparse splitting optical networks with multicast traffic,\u201d Computer Networks, vol. 41, no. 1, pp. 89\u2013113, 2003.","journal-title":"Computer Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4925-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-4925-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4925-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:09Z","timestamp":1559261889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-4925-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4925"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-4925-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}