{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:12:56Z","timestamp":1768281176710,"version":"3.49.0"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571342"],"award-info":[{"award-number":["12571342"]}],"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":["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":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2025.3631647","type":"journal-article","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T18:59:04Z","timestamp":1764010744000},"page":"1777-1788","source":"Crossref","is-referenced-by-count":0,"title":["A Constant-Approximation Algorithm for Budgeted Sweep Coverage With Mobile Sensors"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4586-4959","authenticated-orcid":false,"given":"Wei","family":"Liang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Zhejiang Normal University, Jinhua, Zhejiang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9261-5210","authenticated-orcid":false,"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Management, University at Buffalo, Buffalo, NY, USA"}]},{"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, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3277810"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3300174"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3038156"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3284813"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-021-01033-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.53"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1201"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2629518"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3199389"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.237"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3070062"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2022.06.025","article-title":"Time sensitive sweep coverage with minimum UAVs","volume":"928","author":"Wang","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2012.6214071"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.01.008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2815630"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3008348"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3390\/s21041457"},{"key":"ref18","article-title":"Chargeable sweep coverage problem","author":"Liang","year":"2021","journal-title":"arXiv:2105.06030"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536245"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.03.011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2868931"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-023-02008-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64843-5_45"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-93176-6_1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-025-02275-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/050645464"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276919"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137893"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007385"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229167"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3027434"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.045"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.059"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9610-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_19"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2015.0650"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2023.07.003"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.872110"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01774-5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.10.001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377732"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-010-0252-4"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.05.002"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.010"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9740-5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.06.012"},{"key":"ref49","article-title":"A constant factor approximation for capacitated min-max tree cover,","author":"Das","year":"2020","journal-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2020)"},{"key":"ref50","first-page":"1","article-title":"A fast 3-approximation for the capacitated tree cover problem with edge loads","volume-title":"Proc. 19th Scandin. Symp. Workshops Algorithm Theory (SWAT)","author":"Rockel-Wolff"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2011.03.002"},{"key":"ref52","first-page":"39:1","article-title":"A (3\/2+ \u03b5)-approximation for multiple tsp with a variable number of depots","volume-title":"Proc. 31st Annu. Eur. Symp. Algorithms","volume":"274","author":"Mnich"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01678-3"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112884"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683975"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS51825.2021.9484438"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2014.7020145"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCChina.2015.7448593"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2955139"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237992"},{"key":"ref63","volume":"1","author":"Vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830918500647"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0341-3"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3373543"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11264546.pdf?arnumber=11264546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T21:59:44Z","timestamp":1768255184000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11264546\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":66,"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3631647","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}