{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:15Z","timestamp":1740122355217,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10878-021-00745-x","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T11:08:27Z","timestamp":1619089707000},"page":"187-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient algorithms for support path with time constraint"],"prefix":"10.1007","volume":"42","author":[{"given":"Lili","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Kuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8287-5913","authenticated-orcid":false,"given":"Yuan-Hsiang","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"key":"745_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with application","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with application. Elsevier, New York"},{"key":"745_CR2","doi-asserted-by":"crossref","unstructured":"Carbunar B, Grama A, Vitek J, Carbunar O (2004) Coverage preserving redundancy elimination in sensor networks. In: Proceeding of IEEE Communications Society Conference on the Sensor and Ad Hoc Communications and Networks, pp. 377-386","DOI":"10.1109\/SAHCN.2004.1381939"},{"key":"745_CR3","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1016\/j.adhoc.2013.03.005","volume":"11","author":"L Chunseok","year":"2013","unstructured":"Chunseok L, Donghoo S, Sang BW, Sunghee C (2013) Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. Ad Hoc Networks 11:1699\u20131714","journal-title":"Ad Hoc Networks"},{"issue":"4","key":"745_CR4","first-page":"28","volume":"10","author":"W Gage","year":"1992","unstructured":"Gage W (1992) Command control for many-robot system. Unmanned Syst 10(4):28\u201334","journal-title":"Unmanned Syst"},{"issue":"4","key":"745_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MWC.2002.1028874","volume":"9","author":"A Goldsmith","year":"2002","unstructured":"Goldsmith A, Wicker S (2002) Design challenges for energy-constrained Ad-hoc wireless networks. Wirel Commun 9(4):8\u201327","journal-title":"Wirel Commun"},{"key":"745_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-4-431-65941-9_30","volume":"5","author":"A Howard","year":"2002","unstructured":"Howard A, Mataric M, Sukhatme G (2002) Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem. Distrib Auton Robot Syst 5:299\u2013308","journal-title":"Distrib Auton Robot Syst"},{"key":"745_CR7","doi-asserted-by":"crossref","unstructured":"Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of Annual International Conference on Mobile computing and networking, pp 56-67","DOI":"10.1145\/345910.345920"},{"issue":"6","key":"745_CR8","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1109\/TC.2003.1204831","volume":"52","author":"XY Li","year":"2003","unstructured":"Li XY, Wan PJ, Frieder O (2003) Coverage in wireless Ad-hoc sensor networks. IEEE Trans Comput 52(6):753\u2013763","journal-title":"IEEE Trans Comput"},{"issue":"11","key":"745_CR9","first-page":"1919","volume":"47","author":"Q Luo","year":"2010","unstructured":"Luo Q, Lin YP (2010) Heuristic traversal path algorithm based on linear aggregation in wireless sensor networks. J Comput Res Dev 47(11):1919\u20131927","journal-title":"J Comput Res Dev"},{"issue":"6","key":"745_CR10","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1109\/TCST.2011.2167151","volume":"20","author":"H Mahboubi","year":"2012","unstructured":"Mahboubi H, Momeni A, Aghdam AG, Sayrafian-Pour K, Marbukh V (2012) An efficient target monitoring scheme with controlled node mobility for sensor networks. Control Syst Technol 20(6):1522\u20131532","journal-title":"Control Syst Technol"},{"issue":"12","key":"745_CR11","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1109\/TPDS.2012.329","volume":"24","author":"XF Mao","year":"2013","unstructured":"Mao XF, Liu YH, Tang SJ, Liu HF, Han JK, Li XY (2013) Finding best and worst $$k$$-coverage paths in multihop wireless sensor networks. IEEE Tras Parallel Distrib Syst 24(12):2396\u20132406","journal-title":"IEEE Tras Parallel Distrib Syst"},{"issue":"1","key":"745_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TMC.2005.2","volume":"4","author":"S Megerian","year":"2005","unstructured":"Megerian S, Koushanfar F, Potkonjak M, Srivastava MB (2005) Worst and best-case coverage in sensor networks. IEEE Trans Mob Comput 4(1):4\u201392","journal-title":"IEEE Trans Mob Comput"},{"key":"745_CR13","volume-title":"Spatial tessellations: concepts and applications of voronoi diagram","author":"A Okabe","year":"1999","unstructured":"Okabe A, Boots B, Sugihara K, Chiu SN (1999) Spatial tessellations: concepts and applications of voronoi diagram. Wiley, London"},{"issue":"5","key":"745_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/332833.332838","volume":"43","author":"GJ Pottie","year":"2000","unstructured":"Pottie GJ, Kaiser WJ (2000) Wireless integrated network sensors. Commun of the ACM 43(5):51\u201358","journal-title":"Commun of the ACM"},{"key":"745_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational Geometry. Springer-Verlag, Switzerland"},{"key":"745_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.jda.2012.01.004","volume":"13","author":"SB Roy","year":"2012","unstructured":"Roy SB, Das G, Das SK (2012) Algorithms for computing best coverage path in the presence of obstacles in a sensor field. J Discrete Algorithms 13:86\u201397","journal-title":"J Discrete Algorithms"},{"issue":"11","key":"745_CR17","first-page":"246","volume":"29","author":"XF Shen","year":"2008","unstructured":"Shen XF, Chen JM, Wang Z, Dai GJ (2008) Coverage quality measuring and optimization for moving target in sensor networks. J Commun 29(11):246\u2013252","journal-title":"J Commun"},{"key":"745_CR18","unstructured":"Shih KP, Chen YD, Chiang CW, Liu BI (2006) A distributed active sensor selection scheme for wireless sensor networks. In: Proceeding of IEEE Symposium on Computers and Communications, pp 923-928"},{"key":"745_CR19","doi-asserted-by":"crossref","unstructured":"Wang X, Xing G, Zhang Y, Lu C, Pless R, Gill C (2003) Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of International Conference on Embedded Networked Sensor Systems, pp 28-39","DOI":"10.1145\/958491.958496"},{"key":"745_CR20","unstructured":"Zhang L, Chen X, Fan J, Lin CK (2016) Support path with time constraint in wireless sensor networks. In: 2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)"},{"key":"745_CR21","unstructured":"Zhao Q, Gurusamy M (2006) Maximizing network lifetime for connected target coverage in wireless sensor networks. In: Proceeding of IEEE International Conference on Networking and Communications, pp 94-101"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00745-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00745-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00745-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T05:10:56Z","timestamp":1626066656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00745-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["745"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00745-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,4,22]]},"assertion":[{"value":"8 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}