{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:26:07Z","timestamp":1676420767096},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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,9]]},"DOI":"10.1007\/s10878-005-2273-y","type":"journal-article","created":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T05:56:35Z","timestamp":1124949395000},"page":"199-202","source":"Crossref","is-referenced-by-count":5,"title":["A Note on Optical Network with Nonsplitting Nodes"],"prefix":"10.1007","volume":"10","author":[{"given":"Hongwei","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"My","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2273_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, New York, 1979."},{"key":"2273_CR2","unstructured":"N. Christofides, \u201cWorst-case analysis of a new heuristic for the travelling salesman problem,\u201d Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976."},{"key":"2273_CR3","unstructured":"G. Robins and A. Zelikovsky, \u201cImproved Steiner tree approximation in graphs,\u201d in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2000, pp. 770\u2013779."},{"issue":"1","key":"2273_CR4","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 Comput. Networks, vol. 41, no. 1, pp. 89\u2013113, 2003.","journal-title":"Comput. Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-2273-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-2273-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-2273-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:08Z","timestamp":1559261888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-2273-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2273"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-2273-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}