{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:19:19Z","timestamp":1761401959508,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T00:00:00Z","timestamp":1526428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-018-0306-6","type":"journal-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T11:49:02Z","timestamp":1526471342000},"page":"434-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimizing the total cost of barrier coverage in a linear domain"],"prefix":"10.1007","volume":"36","author":[{"given":"Xiao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Haosheng","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Victor C. S.","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-6237","authenticated-orcid":false,"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yingchao","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Chuang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,16]]},"reference":[{"issue":"1","key":"306_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-016-0153-8","volume":"78","author":"AM Andrews","year":"2017","unstructured":"Andrews AM, Wang H (2017) Minimizing the aggregate movements for interval coverage. Algorithmica 78(1):47\u201385","journal-title":"Algorithmica"},{"issue":"5","key":"306_CR2","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.comnet.2004.06.007","volume":"46","author":"A Arora","year":"2004","unstructured":"Arora A, Dutta P, Bapat S, Kulathumani V, Zhang H, Naik V, Mittal V, Cao H, Demirbas M, Gouda M et al (2004) A line in the sand: a wireless sensor network for target detection, classification, and tracking. Comput Netw 46(5):605\u2013634","journal-title":"Comput Netw"},{"key":"306_CR3","unstructured":"Bar-Noy A, Baumer B (2011) Maximizing network lifetime on the line with adjustable sensing ranges. In: Proceedings of the 7th international workshop on algorithms for sensor systems, wireless ad hoc networks, and autonomous mobile entities. Springer, pp 28\u201341"},{"issue":"1","key":"306_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/16M1071031","volume":"31","author":"A Bar-Noy","year":"2017","unstructured":"Bar-Noy A, Rawitz D, Terlecky P (2017) Maximizing barrier coverage lifetime with mobile sensors. SIAM J Discrete Math 31(1):573\u2013596","journal-title":"SIAM J Discrete Math"},{"key":"306_CR5","doi-asserted-by":"crossref","unstructured":"Carmi P, Katz M, Lev-Tov N (2007) Covering points by unit disks of fixed location. In: Proceedings of 18th international symposium algorithms and computation. Springer, pp 644\u2013655","DOI":"10.1007\/978-3-540-77120-3_56"},{"key":"306_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s00454-013-9525-x","volume":"50","author":"D Chen","year":"2013","unstructured":"Chen D, Gu Y, Li J, Wang H (2013) Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discrete Comput Geom 50:374\u2013408","journal-title":"Discrete Comput Geom"},{"issue":"2","key":"306_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00453-013-9857-1","volume":"72","author":"DZ Chen","year":"2015","unstructured":"Chen DZ, Tan X, Wang H, Wu G (2015) Optimal point movement for covering circular regions. Algorithmica 72(2):379\u2013399","journal-title":"Algorithmica"},{"key":"306_CR8","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: Proceedings of the 9th international conference on ad-hoc, mobile and wireless networks, pp 29\u201342","DOI":"10.1007\/978-3-642-14785-2_3"},{"issue":"5","key":"306_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.orl.2013.06.014","volume":"41","author":"P Rezende de","year":"2013","unstructured":"de Rezende P, Miyazawa F, Sasaki A (2013) A ptas for the disk cover problem of geometric objects. Oper Res Lett 41(5):552\u2013555","journal-title":"Oper Res Lett"},{"key":"306_CR10","doi-asserted-by":"crossref","unstructured":"Dobrev S, Kranakis E, Krizanc D, Lafond M, Ma\u0148uch J, Narayanan L, Opatrny J, Shende S, Stacho L (2017) Weak coverage of a rectangular barrier. In: International conference on algorithms and complexity. Springer, pp 196\u2013208","DOI":"10.1007\/978-3-319-57586-5_17"},{"key":"306_CR11","doi-asserted-by":"crossref","unstructured":"Fan H, Lee VC, Li M, Zhang X, Zhao Y (2014a) Barrier coverage using sensors with offsets. In: International conference on wireless algorithms, systems, and applications. Springer, pp 389\u2013400","DOI":"10.1007\/978-3-319-07782-6_36"},{"issue":"1","key":"306_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2629518","volume":"11","author":"H Fan","year":"2014","unstructured":"Fan H, Li M, Sun X, Wan PJ, Zhao Y (2014b) Barrier coverage by sensors with adjustable ranges. ACM Trans Sensor Netw 11(1):14","journal-title":"ACM Trans Sensor Netw"},{"issue":"2","key":"306_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-008-9146-0","volume":"18","author":"Y Huang","year":"2009","unstructured":"Huang Y, Gao X, Zhang Z, Wu W (2009) A better constant-factor approximation for weighted dominating set in unit disk graph. J Comb Optim 18(2):179\u2013194","journal-title":"J Comb Optim"},{"key":"306_CR14","doi-asserted-by":"crossref","unstructured":"Kumar S, Lai T, Arora A (2005) Barrier coverage with wireless sensors. In: Proceedings of the 11th international conference on mobile computing and networking. ACM, pp 284\u2013298","DOI":"10.1145\/1080829.1080859"},{"issue":"6","key":"306_CR15","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s11276-006-9856-0","volume":"13","author":"S Kumar","year":"2007","unstructured":"Kumar S, Lai T, Arora A (2007) Barrier coverage with wireless sensors. Wirel Netw 13(6):817\u2013834","journal-title":"Wirel Netw"},{"issue":"1","key":"306_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TNET.2016.2574563","volume":"25","author":"A Pananjady","year":"2017","unstructured":"Pananjady A, Bagaria VK, Vaze R (2017) Optimally approximating the coverage lifetime of wireless sensor networks. IEEE\/ACM Trans Netw 25(1):98\u2013111","journal-title":"IEEE\/ACM Trans Netw"},{"key":"306_CR17","doi-asserted-by":"crossref","unstructured":"Saipulla A, Westphal C, Liu B, Wang J (2009) Barrier coverage of line-based deployed wireless sensor networks. In: Proceedings of the 28th IEEE international conference on computer communications. IEEE, pp 127\u2013135","DOI":"10.1109\/INFCOM.2009.5061914"},{"issue":"SI","key":"306_CR18","first-page":"2658","volume":"14","author":"PJ Wan","year":"2006","unstructured":"Wan PJ, Yi CW (2006) Coverage by randomly deployed wireless sensor networks. IEEE\/ACM Trans Netw 14(SI):2658\u20132669","journal-title":"IEEE\/ACM Trans Netw"},{"key":"306_CR19","doi-asserted-by":"crossref","unstructured":"Wan PJ, Xu X, Wang Z (2011) Wireless coverage with disparate ranges. In: Proceedings of the 12th ACM international symposium on mobile ad hoc networking and computing. ACM, pp 1\u20138","DOI":"10.1145\/2107502.2107517"},{"key":"306_CR20","doi-asserted-by":"crossref","unstructured":"Wan PJ, Chen D, Dai G, Wang Z, Yao F (2012) Maximizing capacity with power control under physical interference model in duplex mode. In: Proceedings of the 31st IEEE international conference on computer communications. IEEE, pp 415\u2013423","DOI":"10.1109\/INFCOM.2012.6195780"},{"issue":"12","key":"306_CR21","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1109\/TC.2012.145","volume":"62","author":"B Wang","year":"2013","unstructured":"Wang B, Xu H, Liu W, Liang H (2013) A novel node placement for long belt coverage in wireless networks. IEEE Trans Comput 62(12):2341\u20132353","journal-title":"IEEE Trans Comput"},{"key":"306_CR22","doi-asserted-by":"crossref","unstructured":"Wang H, Zhang X (2015) Minimizing the maximum moving cost of interval coverage. In: Proceedings of the 26th international symposium on algorithms and computation, pp 188\u2013198","DOI":"10.1007\/978-3-662-48971-0_17"},{"key":"306_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2016.12.050","volume":"390","author":"K Xie","year":"2017","unstructured":"Xie K, Ning X, Wang X, He S, Ning Z, Liu X, Wen J, Qin Z (2017) An efficient privacy-preserving compressive data gathering scheme in wsns. Inf Sci 390:82\u201394","journal-title":"Inf Sci"},{"issue":"3","key":"306_CR24","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.tcs.2009.06.022","volume":"412","author":"F Zou","year":"2011","unstructured":"Zou F, Wang Y, Xu XH, Li X, Du H, Wan PJ, Wu W (2011) New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theor Comput Sci 412(3):198\u2013208","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0306-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0306-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0306-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:17:50Z","timestamp":1557955070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0306-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,16]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["306"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0306-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,5,16]]},"assertion":[{"value":"16 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}