{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:47:55Z","timestamp":1777502875643,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T00:00:00Z","timestamp":1441584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0935-y","type":"journal-article","created":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T07:56:32Z","timestamp":1441612592000},"page":"1337-1345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximations for constructing tree-form structures using specific material with fixed length"],"prefix":"10.1007","volume":"10","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[]},{"given":"Li","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Honglin","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,7]]},"reference":[{"key":"935_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(00)00182-1","volume":"262","author":"D Chen","year":"2001","unstructured":"Chen, D., Du, D.Z., Hu, X.D., Lin, G.H., Wang, L., Xue, G.: Approximation for Steienr trees with minimum number of Steiner points. Theor. Comput. Sci. 262, 83\u201399 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"935_CR2","first-page":"1396","volume":"14","author":"YJ Chu","year":"1965","unstructured":"Chu, Y.J., Liu, Z.H.: On the shortest arborescence of a directed graph. Sci. Sin. 14, 1396\u20131400 (1965)","journal-title":"Sci. Sin."},{"key":"935_CR3","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"EG Coffman","year":"1996","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS, Boston (1996)"},{"key":"935_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"935_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stand. Sect. B 71, 233\u2013240 (1967)","journal-title":"J. Res. Natl. Bur. Stand. Sect. B"},{"key":"935_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"GH Lin","year":"1999","unstructured":"Lin, G.H., Xue, G.L.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inf. Process. Lett. 69, 53\u201357 (1999)","journal-title":"Inf. Process. Lett."},{"key":"935_CR7","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)"},{"key":"935_CR8","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"935_CR9","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Dordrecht (2003)"},{"key":"935_CR10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Nav. Res. Logist. 41, 579\u2013585 (1994)","journal-title":"Nav. Res. Logist."},{"key":"935_CR11","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0935-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0935-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0935-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0935-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,7]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["935"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0935-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,7]]}}}