{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:43:23Z","timestamp":1772207003737,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T00:00:00Z","timestamp":1534982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771013"],"award-info":[{"award-number":["11771013"]}],"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":["11531011"],"award-info":[{"award-number":["11531011"]}],"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":["61751303"],"award-info":[{"award-number":["61751303"]}],"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":[[2019,5]]},"DOI":"10.1007\/s10878-018-0341-3","type":"journal-article","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T02:54:43Z","timestamp":1534992883000},"page":"1111-1125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Approximation algorithms for distance constraint sweep coverage with base stations"],"prefix":"10.1007","volume":"37","author":[{"given":"Jian","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"1","key":"341_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"EM Arkin","year":"2006","unstructured":"Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min\u2013max vehicle routing problems. J Algorithms 59(1):1\u201318","journal-title":"J Algorithms"},{"issue":"5","key":"341_CR2","doi-asserted-by":"publisher","first-page":"1850064","DOI":"10.1142\/S1793830918500647","volume":"10","author":"Q Chen","year":"2018","unstructured":"Chen Q, Huang X, Ran Y (2018) Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discrete Math Algorithms Appl 10(5):1850064","journal-title":"Discrete Math Algorithms Appl"},{"key":"341_CR3","unstructured":"Cheng W, Li M, Liu K, Liu Y, Li X, Liao X (2008) Sweep coverage with mobile sensors. In: IEEE international symposium on parallel and distributed processing. IEEE, pp 1\u20139"},{"key":"341_CR4","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. In: Traub JF (ed) Symposium on new directions and recent results in algorithms and complexity. Academic Press, Orlando, p 441"},{"key":"341_CR5","unstructured":"Du J, Li Y, Liu H, Sha K (2011) On sweep coverage with minimum mobile sensors. In: IEEE, international conference on parallel and distributed systems. IEEE, pp 283\u2013290"},{"key":"341_CR6","doi-asserted-by":"crossref","unstructured":"Gao X, Zhu X, Feng Y, Wu F, Chen G (2016) Data ferry trajectory planning for sweep coverage problem with multiple mobile sensors. In: IEEE international conference on sensing, communication and networking. IEEE, pp 1\u20139","DOI":"10.1109\/SAHCN.2016.7732979"},{"issue":"2","key":"341_CR7","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1109\/TNET.2018.2815630","volume":"26","author":"X Gao","year":"2018","unstructured":"Gao X, Fan J, Wu F, Chen G (2018) Approximation algorithms for sweep coverage problem with multiple mobile sensors. IEEE\/ACM Trans Netw 26(2):990\u20131003","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"9","key":"341_CR8","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.ipl.2015.03.011","volume":"115","author":"B Gorain","year":"2015","unstructured":"Gorain B, Mandal PS (2015) Approximation algorithm for sweep coverage on graph. Inf Process Lett 115(9):712\u2013718","journal-title":"Inf Process Lett"},{"key":"341_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.dam.2016.09.028","volume":"228","author":"B Gorain","year":"2016","unstructured":"Gorain B, Mandal PS (2016) Solving energy issues for sweep coverage in wireless sensor networks. Discrete Appl Math 228:130\u2013139","journal-title":"Discrete Appl Math"},{"key":"341_CR10","doi-asserted-by":"crossref","unstructured":"Huang P, Lin F, Liu C, Gao J, Zhou J (2015) ACO-based sweep coverage scheme in wireless sensor networks. J Sensors 2015. Article ID 484902","DOI":"10.1155\/2015\/484902"},{"key":"341_CR11","doi-asserted-by":"crossref","unstructured":"Kawamura A, Kobayashi Y (2012) Fence patrolling by mobile agents with distinct speeds. In: International symposium on algorithms and computation. Springer, Berlin Heidelberg, pp 598\u2013608","DOI":"10.1007\/978-3-642-35261-4_62"},{"issue":"1","key":"341_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/net.3230140113","volume":"14","author":"G Laporte","year":"1984","unstructured":"Laporte G, Desrochers M, Nobert Y (1984) Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1):161\u2013172","journal-title":"Networks"},{"issue":"4","key":"341_CR13","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1287\/opre.40.4.790","volume":"40","author":"CL Li","year":"1992","unstructured":"Li CL, Simchi-Levi D, Desrochers M (1992) On the distance constrained vehicle routing problem. Oper Res 40(4):790\u2013799","journal-title":"Oper Res"},{"issue":"11","key":"341_CR14","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/TMC.2010.261","volume":"10","author":"M Li","year":"2011","unstructured":"Li M, Cheng W, Liu K, He Y, Li X, Liao X (2011) Sweep coverage with mobile sensors. IEEE Trans Mob Comput 10(11):1534\u20131545","journal-title":"IEEE Trans Mob Comput"},{"key":"341_CR15","unstructured":"Liu C, Du H, Ye Q (2017) Sweep coverage with return time constraint. In: 2016 IEEE global communications conference (GLOBECOM). IEEE, pp 1\u20136"},{"issue":"2","key":"341_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.20435","volume":"59","author":"V Nagarajan","year":"2012","unstructured":"Nagarajan V, Ravi R (2012) Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2):209\u2013214","journal-title":"Networks"},{"issue":"2","key":"341_CR17","first-page":"698","volume":"2","author":"C Shamily","year":"2013","unstructured":"Shamily C, Angelin PAC (2013) Efficient localized deployment algorithm with balanced energy consumption in wireless sensor networks. Int J Adv Res Comput Eng Technol 2(2):698\u2013702","journal-title":"Int J Adv Res Comput Eng Technol"},{"key":"341_CR18","doi-asserted-by":"crossref","unstructured":"Wang C, Ma H (2011) Data collection with multiple controlled mobile nodes in wireless sensor networks. In: International conference on parallel and distributed systems IEEE Computer Society. IEEE, pp 489\u2013496","DOI":"10.1109\/ICPADS.2011.49"},{"issue":"3","key":"341_CR19","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TC.2013.2295609","volume":"64","author":"W Xu","year":"2015","unstructured":"Xu W, Liang W, Lin X (2015) Approximation algorithms for min\u2013max cycle cover problems. IEEE Trans Comput 64(3):600\u2013613","journal-title":"IEEE Trans Comput"},{"key":"341_CR20","doi-asserted-by":"crossref","unstructured":"Yang M, Kim D, Li D, Chen W, Du H, Tokuta AO (2013) Sweep-coverage with energy-restricted mobile wireless sensor nodes. In: Wireless algorithms, systems, and applications, vol 7992. Springer, Berlin Heidelberg, pp 486\u2013497","DOI":"10.1007\/978-3-642-39701-1_40"},{"key":"341_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2016.01.041","volume":"654","author":"W Yu","year":"2016","unstructured":"Yu W, Liu Z (2016) Improved approximation algorithms for some min\u2013max and minimum cycle cover problems. Theor Comput Sci 654:45\u201358","journal-title":"Theor Comput Sci"},{"key":"341_CR22","doi-asserted-by":"crossref","unstructured":"Zhao D, Ma H, Liu L (2012) Mobile sensor scheduling for timely sweep coverage. In: Wireless communications and networking conference. IEEE, pp 1771\u20131776","DOI":"10.1109\/WCNC.2012.6214071"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0341-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0341-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0341-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T10:41:55Z","timestamp":1568976115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0341-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,23]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["341"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0341-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,23]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}