{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T05:17:33Z","timestamp":1769663853180,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T00:00:00Z","timestamp":1730505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T00:00:00Z","timestamp":1730505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U20A2068"],"award-info":[{"award-number":["U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s11590-024-02160-7","type":"journal-article","created":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T15:03:02Z","timestamp":1730559782000},"page":"1117-1123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An approximation algorithm for the prize-collecting connected dominating set problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Yaoyao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,2]]},"reference":[{"key":"2160_CR1","volume-title":"Design and Analysis of Approximation Algorithms","author":"D Dingzhu","year":"2012","unstructured":"Dingzhu, D., Ker-I, K., Xiaodong, H.: Design and Analysis of Approximation Algorithms. Springer, New York (2012)"},{"issue":"1","key":"2160_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"E Anthony","year":"1987","unstructured":"Anthony, E., Wieselthier, J.E., Baker, D.J.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE 75(1), 56\u201373 (1987)","journal-title":"Proc. IEEE"},{"key":"2160_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"G Sudipto","year":"1998","unstructured":"Sudipto, G., Samir, K.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"2160_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"1","key":"2160_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"G Sudipto","year":"1999","unstructured":"Sudipto, G., Samir, K.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150(1), 57\u201374 (1999)","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"2160_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Hongwei, D., Jia Xiaohua, W., Weili, L.Y., Ker-I, K.: A greedy approximation for minimum connected dominating sets. Theoret. Comput. Sci. 329(1\u20133), 325\u2013330 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2160_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/18M1212094","volume":"34","author":"K Samir","year":"2020","unstructured":"Samir, K., Manish, P., Sarpatwar, K.K.: Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems. SIAM J. Discret. Math. 34(1), 251\u2013270 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"2160_CR8","first-page":"744","volume":"1","author":"C Markarian","year":"2021","unstructured":"Markarian, C., El-Kassar, A.N.: Algorithmic view of online prize-collecting optimization problems. ICEIS 1, 744\u2013751 (2021)","journal-title":"ICEIS"},{"key":"2160_CR9","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Sadeghian, S., Sanita, L.: An LMP O($$\\log n$$)-approximation algorithm for node weighted prize collecting Steiner tree. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE, pp. 568\u2013577 (2013)","DOI":"10.1109\/FOCS.2013.67"},{"issue":"2","key":"2160_CR10","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/S0097539702420474","volume":"37","author":"M Anna","year":"2007","unstructured":"Anna, M., Yuval, R.: Approximation algorithms for constrained node weighted Steiner tree problems. SIAM J. Comput. 37(2), 460\u2013481 (2007)","journal-title":"SIAM J. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02160-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02160-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02160-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:08:11Z","timestamp":1750154891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02160-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,2]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2160"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02160-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,2]]},"assertion":[{"value":"9 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}