{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:32:38Z","timestamp":1778578358292,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,27]],"date-time":"2017-03-27T00:00:00Z","timestamp":1490572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11371001"],"award-info":[{"award-number":["11371001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["06446"],"award-info":[{"award-number":["06446"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11501412"],"award-info":[{"award-number":["11501412"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s11590-017-1135-8","type":"journal-article","created":{"date-parts":[[2017,3,27]],"date-time":"2017-03-27T05:57:09Z","timestamp":1490594229000},"page":"573-585","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A 5-approximation algorithm for the k-prize-collecting Steiner tree problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Lu","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,27]]},"reference":[{"key":"1135_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/090771429","volume":"40","author":"A Archer","year":"2011","unstructured":"Archer, A., Bateni, M.H., Hajiaghayi, M.T., Karloff, H.: Improved approximation algorithms for prize-collecting Steiner tree and TSP. SIAM J. Comput. 40, 309\u2013332 (2011)","journal-title":"SIAM J. Comput."},{"key":"1135_CR2","unstructured":"Arora, S, Karakostas, G.: A $$2+\\varepsilon $$ 2 + \u03b5 approximation algorithm for the $$k$$ k -MST problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 754\u2013759 (2000)"},{"key":"1135_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0020-0190(98)00010-6","volume":"65","author":"S Arya","year":"1998","unstructured":"Arya, S., Ramesh, H.: A, $$2.5$$ 2.5 -factor approximation algorithm for the $$k$$ k -MST problem. Inf. Process. Lett. 65, 117\u2013118 (1998)","journal-title":"Inf. Process. Lett."},{"key":"1135_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1137\/S009753979528826X","volume":"28","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: Improved approximation guarantees for minimum-weight $$k$$ k -trees and prize-collecting salesmen. SIAM J. Comput. 28, 254\u2013262 (1999)","journal-title":"SIAM J. Comput."},{"key":"1135_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.P.: A note on the prize collecting traveling salesman problem. Math. Programm. 59, 413\u2013420 (1993)","journal-title":"Math. Programm."},{"key":"1135_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Ravi, R., Vempala, S.: A constant-factor approximation algorithm for the $$k$$ k -MST problem. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 442\u2013448 (1996)","DOI":"10.1145\/237814.237992"},{"key":"1135_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10107-003-0479-2","volume":"100","author":"FA Chudak","year":"2004","unstructured":"Chudak, F.A., Roughgarden, T., Williamson, D.P.: Approximate $$k$$ k -MSTs and $$k$$ k -Steiner trees via the primal\u2013dual method and Lagrangean relaxation. Math. Programm. 100, 411\u2013421 (2004)","journal-title":"Math. Programm."},{"key":"1135_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230240103","volume":"24","author":"Fischetti M","year":"1994","unstructured":"M, Fischetti, HW, Hamacher, J\u00f8rnsten, K., Maffioli, F.: Weighted $$k$$ k -cardinality trees complexity and polyhedral structure. Networks 24, 11\u201321 (1994)","journal-title":"Networks"},{"key":"1135_CR9","doi-asserted-by":"crossref","unstructured":"Garg, N.: A $$3$$ 3 -approximation for the minimum tree spanning $$k$$ k vertices. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 302\u2013309 (1996)","DOI":"10.1109\/SFCS.1996.548489"},{"key":"1135_CR10","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a $$2$$ 2 -approximation for the $$k$$ k -MST problem in graphs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 396\u2013402 (2005)","DOI":"10.1145\/1060590.1060650"},{"key":"1135_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"1135_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$ k -median problems using the primal\u2013dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"1135_CR13","unstructured":"Rajagopalan, S., Vazirani, V.V.: Logarithmic approximation of minimum weight $$k$$ k trees. Unpublished manuscript (1995)"},{"key":"1135_CR14","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/S0895480194266331","volume":"9","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.: Spanning trees short or small. SIAM J. Discrete Math. 9, 178\u2013200 (1996)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1135-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1135-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1135-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T20:53:14Z","timestamp":1692737594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1135-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,27]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["1135"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1135-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,27]]},"assertion":[{"value":"4 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}