{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:52:06Z","timestamp":1777503126187,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861075"],"award-info":[{"award-number":["11861075"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Joint Project of Yunnan Provincial Science and Technology Department and Yunnan University","award":["2018FY001(-014)"],"award-info":[{"award-number":["2018FY001(-014)"]}]},{"name":"IRTSTYN"},{"name":"Project for Innovation Team (Cultivation) of Yunnan Province"},{"name":"the China Scholarship Council","award":["No.201807030001"],"award-info":[{"award-number":["No.201807030001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00543-x","type":"journal-article","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T13:05:55Z","timestamp":1581944755000},"page":"1774-1795","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation algorithms for constructing required subgraphs using stock pieces of fixed length"],"prefix":"10.1007","volume":"44","author":[{"given":"Junran","family":"Lichen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ko-Wei","family":"Lih","sequence":"additional","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"key":"543_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13915-9","volume-title":"Optimal interconnection trees in the plane: theory, algorithms and applications","author":"B Brazil","year":"2015","unstructured":"Brazil B, Zachariasen M (2015) Optimal interconnection trees in the plane: theory, algorithms and applications. Springer, Switzerland"},{"key":"543_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"DH Chen","year":"2000","unstructured":"Chen DH, Du DZ, Hu XD, Lin GH, Wang LS, Xue G (2000) Approximation for Steiner trees with minimum number of Steiner points. J Glob Optim 18:17\u201333","journal-title":"J Glob Optim"},{"key":"543_CR3","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"EG Coffman","year":"1996","unstructured":"Coffman EG, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: a survey. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS Publishing, Boston, pp 46\u201393"},{"key":"543_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269\u2013271","journal-title":"Numerische Mathematik"},{"key":"543_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco"},{"issue":"1","key":"543_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin R (1992) Approximation schemes for the restricted shortest path problem. Math Oper Res 17(1):36\u201342","journal-title":"Math Oper Res"},{"key":"543_CR7","series-title":"Annals of Discrete Mathematics","volume-title":"The Steiner tree problem","author":"FK Hwang","year":"1992","unstructured":"Hwang FK, Richard D, Winter P (1992) The Steiner tree problem, vol 53. Annals of Discrete Mathematics. North-Holland, Amsterdam"},{"key":"543_CR8","doi-asserted-by":"crossref","unstructured":"Karmarkar N , Karp RM (1982) An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of 23rd annual IEEE symposium on foundations of computer science, 3\u20135 Nov, 1982, pp 312\u2013320","DOI":"10.1109\/SFCS.1982.61"},{"key":"543_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2013.07.033","volume":"232","author":"JP Li","year":"2014","unstructured":"Li JP, Ge Y, He S, Lichen JR (2014) Approximation algorithms for constructing some required structures in digraphs. Eur J Oper Res 232:307\u2013314","journal-title":"Eur J Oper Res"},{"issue":"6","key":"543_CR10","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s11590-015-0935-y","volume":"10","author":"JP Li","year":"2016","unstructured":"Li JP, Guan L, Ding HL, Li WD (2016) Approximations for constructing tree-form structures using specific material with fixed length. Optim Lett 10(6):1337\u20131345","journal-title":"Optim Lett"},{"key":"543_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"GH Lin","year":"1999","unstructured":"Lin GH, Xue GL (1999) Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inform Process Lett 69:53\u201357","journal-title":"Inform Process Lett"},{"key":"543_CR12","doi-asserted-by":"crossref","unstructured":"Ramamurthy B, Iness J, Mukherjee B (1997) Minimizing the number of optical amplifiers needed to support a multi-wavelength optical lAN\/MAN. In: Proceedings of IEEE INFOCOM\u201997, pp 261\u2013268","DOI":"10.1109\/INFCOM.1997.635138"},{"issue":"1","key":"543_CR13","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s00453-007-9114-6","volume":"55","author":"J Remy","year":"2009","unstructured":"Remy J, Steger A (2009) Approximation schemes for node-weighted geometric Steiner tree problems. Algorithmica 55(1):240\u2013267","journal-title":"Algorithmica"},{"issue":"3","key":"543_CR14","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/12.127452","volume":"41","author":"M Sarrafzadeh","year":"1992","unstructured":"Sarrafzadeh M, Wong CK (1992) Bottleneck Steiner trees in the plane. IEEE Trans Comput 41(3):370\u2013374","journal-title":"IEEE Trans Comput"},{"key":"543_CR15","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, The Netherlands"},{"issue":"1","key":"543_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A Segev","year":"1987","unstructured":"Segev A (1987) The node-weighted Steiner tree problem. Networks 17(1):1\u201317","journal-title":"Networks"},{"key":"543_CR17","doi-asserted-by":"publisher","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 (1994) New worst-case results for the bin-packing problem. Naval Res Logist 41:579\u2013585","journal-title":"Naval Res Logist"},{"key":"543_CR18","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00543-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00543-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00543-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:45:05Z","timestamp":1664354705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00543-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["543"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00543-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]},"assertion":[{"value":"17 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}