{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:51Z","timestamp":1753885011676,"version":"3.41.2"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","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":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p> In a sweep cover problem, points of interest (PoIs) are required to be visited by mobile sensors periodically. The time span between two consecutive visits of a PoI is the sweep-period of that PoI. In this paper, we study the min sweep-period sweep cover problem with a distance constraint (MinSPSC[Formula: see text]). Given [Formula: see text] mobile sensors with speed [Formula: see text], [Formula: see text] base stations and a distance constraint [Formula: see text], the goal of MinSPSC[Formula: see text] is to design routes for the mobile sensors such that the maximum sweep-period is minimized under the condition that every mobile sensor has to visit a base station before traveling distance [Formula: see text]. We present an [Formula: see text]-approximation algorithm for MinSPSC[Formula: see text], where [Formula: see text] is the maximum distance between a PoI and a base station. <\/jats:p>","DOI":"10.1142\/s1793830923501100","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T03:04:05Z","timestamp":1702350245000},"source":"Crossref","is-referenced-by-count":0,"title":["Approximation algorithm for min sweep-period sweep cover with distance constraint"],"prefix":"10.1142","volume":"16","author":[{"given":"Yidong","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"S1793830923501100BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830918500647"},{"key":"S1793830923501100BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/RAIT57693.2023.10126982"},{"key":"S1793830923501100BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2815630"},{"key":"S1793830923501100BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3008348"},{"key":"S1793830923501100BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.03.011"},{"key":"S1793830923501100BIB006","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/192194"},{"key":"S1793830923501100BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0226-3"},{"key":"S1793830923501100BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.237"},{"key":"S1793830923501100BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0341-3"},{"key":"S1793830923501100BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.06.026"},{"key":"S1793830923501100BIB012","first-page":"1","author":"Liang W.","year":"2023","journal-title":"Optim. Lett."},{"key":"S1793830923501100BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3070062"},{"key":"S1793830923501100BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.05.012"},{"key":"S1793830923501100BIB015","unstructured":"T. T. Struhsaker ,  Guidelines for Biological Monitoring and Research in Africa\u2019s Rain Forest Protected Areas. A Report to the Center for Applied Biodiversity Science, Conservation International  (Conservation International,  Durham,  2002),  pp. 1\u201355."},{"volume-title":"Approximation Algorithms","year":"2001","author":"Vazirani V. V.","key":"S1793830923501100BIB016"},{"key":"S1793830923501100BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2940717"},{"key":"S1793830923501100BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52824-9"},{"key":"S1793830923501100BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39701-1_40"},{"key":"S1793830923501100BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2012.6214071"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923501100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T04:25:09Z","timestamp":1730435109000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923501100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":19,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1142\/S1793830923501100"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923501100","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"article-number":"2350110"}}