{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T17:50:52Z","timestamp":1772560252588,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T00:00:00Z","timestamp":1713744000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T00:00:00Z","timestamp":1713744000000},"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901533"],"award-info":[{"award-number":["11901533"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01166-2","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T20:29:32Z","timestamp":1713817772000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation algorithms for maximum weighted target cover problem with distance limitations"],"prefix":"10.1007","volume":"47","author":[{"given":"Jianhong","family":"Jin","sequence":"first","affiliation":[]},{"given":"Yingli","family":"Ran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,22]]},"reference":[{"key":"1166_CR1","first-page":"1","volume":"66","author":"P Chaturvedi","year":"2022","unstructured":"Chaturvedi P, Daniel AK (2022) A comprehensive review on scheduling based approaches for target coverage in WSN. Wirel Pers Commun 66:1\u201353","journal-title":"Wirel Pers Commun"},{"key":"1166_CR2","doi-asserted-by":"crossref","unstructured":"Chekuri C, Kumar A (2004) Maximum coverage problem with group budget constraints and applications. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques, vol 3122. Berlin, pp 72\u201383","DOI":"10.1007\/978-3-540-27821-4_7"},{"key":"1166_CR3","doi-asserted-by":"crossref","unstructured":"Chen Z, Gao X, Wu F, Chen G (2016) A PTAS to minimize mobile sensor movement for target coverage problem. In: IEEE INFOCOM 2016\u2014the 35th annual IEEE international conference on computer communications, San Francisco, CA, USA, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524334"},{"key":"1166_CR4","doi-asserted-by":"crossref","unstructured":"Cherry A, Gudmundsson J, Mestre J (2017) Barrier coverage with uniform radii in 2d. In: Algorithms for sensor systems: 13th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2017, Vienna, Austria, September 7\u20138, 2017, Revised Selected Papers 13. Springer, pp 57\u201469","DOI":"10.1007\/978-3-319-72751-6_5"},{"key":"1166_CR5","doi-asserted-by":"crossref","unstructured":"Czyzowicz J, Kranakis E, Krizanc D, Lambadaris I, Narayanan L, Opatrny J, Stacho L, Urrutia J, Yazdani M (2010) On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Ad-hoc, mobile and wireless networks: 9th international conference, ADHOC-NOW 2010, Edmonton, AB, Canada, August 20\u201322, 2010. Proceedings 9. Springer, pp 29\u201342","DOI":"10.1007\/978-3-642-14785-2_3"},{"key":"1166_CR6","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-016-0102-0","volume":"34","author":"B Farbstein","year":"2017","unstructured":"Farbstein B, Levin A (2017) Maximum coverage problem with group budget constraints. J Combin Optim 34:725\u2013735","journal-title":"J Combin Optim"},{"key":"1166_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2019.02.015","volume":"788","author":"L Guo","year":"2019","unstructured":"Guo L, Li M, Xu D (2019) Efficient approximation algorithms for maximum coverage with group budget constraints. Theor Comput Sci 788:53\u201365","journal-title":"Theor Comput Sci"},{"key":"1166_CR8","doi-asserted-by":"crossref","unstructured":"Guo L, Zou W, Wu C, Xu D, Du D (2021) Minsum movement of barrier and target coverage using sink-based mobile sensors on the plane. In: 2021 IEEE 41st international conference on distributed computing systems (ICDCS). IEEE, pp 696\u2013706","DOI":"10.1109\/ICDCS51616.2021.00072"},{"issue":"1","key":"1166_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J ACM 32(1):130\u2013136","journal-title":"J ACM"},{"key":"1166_CR10","doi-asserted-by":"crossref","unstructured":"Iida E, Yamashita M (2023) An infeasible interior-point arc-search method with Nesterov\u2019s restarting strategy for linear programming problems. arXiv preprint arXiv:2303.01666","DOI":"10.1007\/s10589-024-00561-z"},{"issue":"1","key":"1166_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.3390\/asi3010014","volume":"3","author":"D Kandris","year":"2020","unstructured":"Kandris D, Nakas C, Vomvas D, Koulouras G (2020) Applications of wireless sensor networks: an up-to-date survey. Appl Syst Innov 3(1):14","journal-title":"Appl Syst Innov"},{"issue":"1","key":"1166_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11276-015-1133-7","volume":"23","author":"X Li","year":"2017","unstructured":"Li X, Li D, Wan J, Vasilakos A, Lai C, Wang S (2017) A review of industrial wireless networks in the context of industry 4.0. Wirel Netw 23(1):23\u201341","journal-title":"Wirel Netw"},{"issue":"1","key":"1166_CR13","first-page":"240","volume":"163","author":"J Liang","year":"2014","unstructured":"Liang J, Liu M, Kui X (2014) A survey of coverage problems in wireless sensor networks. Sens Transducers 163(1):240","journal-title":"Sens Transducers"},{"issue":"7","key":"1166_CR14","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/TPDS.2014.2333011","volume":"26","author":"Z Liao","year":"2014","unstructured":"Liao Z, Wang J, Zhang S, Cao J, Min G (2014) Minimizing movement for target coverage and network connectivity in mobile sensor networks. IEEE Trans Parallel Distrib Syst 26(7):1971\u20131983","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"5","key":"1166_CR15","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1109\/TIM.2017.2771979","volume":"67","author":"L Lombardo","year":"2017","unstructured":"Lombardo L, Corbellini S, Parvis M, Elsayed A, Angelini E, Grassini S (2017) Wireless sensor network for distributed environmental monitoring. IEEE Trans Instrum Meas 67(5):1214\u20131222","journal-title":"IEEE Trans Instrum Meas"},{"issue":"8","key":"1166_CR16","doi-asserted-by":"publisher","first-page":"2056","DOI":"10.1109\/TIM.2017.2677619","volume":"66","author":"G Mois","year":"2017","unstructured":"Mois G, Folea S, Sanislav T (2017) Analysis of three iot-based wireless sensors for environmental monitoring. IEEE Trans Instrum Meas 66(8):2056\u20132064","journal-title":"IEEE Trans Instrum Meas"},{"key":"1166_CR17","doi-asserted-by":"publisher","first-page":"119486","DOI":"10.1016\/j.eswa.2022.119486","volume":"217","author":"LV Quan","year":"2023","unstructured":"Quan LV, Hanh NT, Binh HTT, Toan VD, Ngoc DT, Lam BT (2023) A bi-population genetic algorithm based on multi-objective optimization for a relocation scheme with target coverage constraints in mobile wireless sensor networks. Expert Syst Appl 217:119486","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1166_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/TMC.2007.57","volume":"4","author":"A Somasundara","year":"2007","unstructured":"Somasundara A, Ramamoorthy A, Srivastava M (2007) Mobile element scheduling with dynamic deadlines. IEEE Trans Mob Comput 4(6):395\u2013410","journal-title":"IEEE Trans Mob Comput"},{"issue":"3","key":"1166_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/TMC.2009.125","volume":"9","author":"R Tan","year":"2009","unstructured":"Tan R, Xing G, Wang J, So HC (2009) Exploiting reactive mobility for collaborative target detection in wireless sensor networks. IEEE Trans Mob Comput 9(3):317\u2013332","journal-title":"IEEE Trans Mob Comput"},{"issue":"4","key":"1166_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978802.1978811","volume":"43","author":"B Wang","year":"2011","unstructured":"Wang B (2011) Coverage problems in sensor networks: a survey. ACM Comput Surv 43(4):1\u201353","journal-title":"ACM Comput Surv"},{"key":"1166_CR21","unstructured":"Wongwattanakij N, Phetmak N, Jaikaeo C, Fakcharoenphol J (2023) An improved ptas for covering targets with mobile sensors. arXiv preprint arXiv:2305.03946"},{"key":"1166_CR22","doi-asserted-by":"crossref","unstructured":"Wu W, Zhang Z, Lee W, Du D-Z (2020) Optimal coverage in wireless sensor networks, vol 162. Springer optimization and its applications. Springer, Cham","DOI":"10.1007\/978-3-030-52824-9"},{"key":"1166_CR23","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2022.10.046","volume":"941","author":"W Zou","year":"2023","unstructured":"Zou W, Guo L, Hao C, Liu L (2023) Approximation algorithm for minsum linear barrier coverage with sink-based mobile sensors on the plane. Theor Comput Sci 941:121\u2013130","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01166-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01166-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01166-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:10:47Z","timestamp":1715951447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01166-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,22]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1166"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01166-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,22]]},"assertion":[{"value":"31 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2024","order":2,"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"}}],"article-number":"60"}}