{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:39:39Z","timestamp":1755034779384,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00453-019-00611-7","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T07:03:36Z","timestamp":1564383816000},"page":"721-746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Weak Coverage of a Rectangular Barrier"],"prefix":"10.1007","volume":"82","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6149-003X","authenticated-orcid":false,"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Stacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"issue":"1","key":"611_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s00453-016-0153-8","volume":"78","author":"AM Andrews","year":"2017","unstructured":"Andrews, A.M., Wang, H.: Minimizing the aggregate movements for interval coverage. Algorithmica 78(1), 48\u201385 (2017)","journal-title":"Algorithmica"},{"key":"611_CR2","doi-asserted-by":"crossref","unstructured":"Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable density estimates for coverage and connectivity in thin strips of finite length. In: ACM International Conference on Mobile Computing and Networking, pp. 75\u201386 (2007)","DOI":"10.1145\/1287853.1287863"},{"key":"611_CR3","doi-asserted-by":"crossref","unstructured":"Ban, D., Jiang, J., Yang, W., Dou, W., Yi, H.: Strong k-barrier coverage with mobile sensors. In: Proceedings of International Wireless Communications and Mobile Computing Conference, pp. 68\u201372 (2010)","DOI":"10.1145\/1815396.1815413"},{"key":"611_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results. In: Proceedings of ICALP 1999, LNCS, vol. 1644, pp. 200\u2013209 (1999)","DOI":"10.1007\/3-540-48523-6_17"},{"key":"611_CR5","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Technical Report TR03-049, ECCC (2003)"},{"issue":"52","key":"611_CR6","doi-asserted-by":"publisher","first-page":"5515","DOI":"10.1016\/j.tcs.2009.07.007","volume":"410","author":"B Bhattacharya","year":"2009","unstructured":"Bhattacharya, B., Burmester, M., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52), 5515\u20135528 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"611_CR7","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.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discrete Comput. Geom. 50, 374\u2013408 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"611_CR8","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Proceedings of ADHOCNOW, LNCS, vol. 5793, pp. 194\u2013212. Springer (2009)","DOI":"10.1007\/978-3-642-04383-3_15"},{"key":"611_CR9","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Proceedings of ADHOCNOW, LNCS, vol. 6288, pp. 29\u201342. Springer (2010)","DOI":"10.1007\/978-3-642-14785-2_3"},{"key":"611_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2015.02.006","volume":"579","author":"S Dobrev","year":"2015","unstructured":"Dobrev, S., Durocher, S., Eftekhari, M., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S., Urrutia, J.: Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579, 64\u201373 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"611_CR11","first-page":"196","volume-title":"Lecture Notes in Computer Science","author":"Stefan Dobrev","year":"2017","unstructured":"Dobrev, S., Kranakis, E., Krizanc, D., Lafond, M., Ma\u0148uch, J., Narayanan, L., Opatrny, J., Stacho, L.: Weak coverage of a rectangular barrier. In: Proceedings of CIAC 2017 Conference, LNCS, vol. 10236, pp. 196\u2013208 (2017)"},{"key":"611_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-09620-9_19","volume-title":"Structural Information and Communication Complexity","author":"Mohsen Eftekhari","year":"2014","unstructured":"Eftekhari, M., Flocchini, P., Narayanan, L., Opatrny, J., Santoro, N.: Distributed barrier coverage with relocatable sensors. In: Proceedings of Sirocco 2014 Conference, LNCS, vol. 8576, pp. 235\u2013249 (2014)"},{"issue":"5","key":"611_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00446-016-0267-x","volume":"29","author":"M Eftekhari","year":"2016","unstructured":"Eftekhari, M., Kranakis, E., Krizanc, D., Morales-Ponce, O., Narayanan, L., Opatrny, J., Shende, S.: Distributed algorithms for barrier coverage using relocatable sensors. Distrib. Comput. 29(5), 361\u2013376 (2016)","journal-title":"Distrib. Comput."},{"key":"611_CR14","doi-asserted-by":"crossref","unstructured":"Eftekhari, M., Narayanan, L., Opatrny, J.: On multi-round sensor deployment for barrier coverage. In: Proceedings of 10th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS), pp. 310\u2013318 (2013)","DOI":"10.1109\/MASS.2013.85"},{"key":"611_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.comcom.2014.10.003","volume":"55","author":"M Habib","year":"2015","unstructured":"Habib, M.: Stochastic barrier coverage in wireless sensor networks based on distributed learning automata. Comput. Commun. 55, 51\u201361 (2015)","journal-title":"Comput. Commun."},{"key":"611_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-28472-9_3","volume-title":"Algorithms for Sensor Systems","author":"Evangelos Kranakis","year":"2015","unstructured":"Kranakis, E., Krizanc, D., Luccio, F.L., Smith, B.: Maintaining intruder detection capability in a rectangular domain with sensors. In: Proceedings of ALGOSENSORS 2015, LNCS, vol. 9536, pp. 27\u201340 (2015)"},{"key":"611_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of the 11th ACM International Conference on Mobile Computing and Networking, pp. 284\u2013298 (2005)","DOI":"10.1145\/1080829.1080859"},{"key":"611_CR18","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.comnet.2010.10.008","volume":"55","author":"L Li","year":"2011","unstructured":"Li, L., Zhang, B., Shen, X., Zheng, J., Yao, Z.: A study on the weak barrier coverage problem in wireless sensor networks. Comput. Netw. 55, 711\u2013721 (2011)","journal-title":"Comput. Netw."},{"issue":"11","key":"611_CR19","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1109\/TMC.2010.261","volume":"10","author":"X Li","year":"2011","unstructured":"Li, X., Frey, H., Santoro, N., Stojmenovic, I.: Strictly localized sensor self-deployment for optimal focused coverage. IEEE Trans. Mob. Comput. 10(11), 1520\u20131533 (2011)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"611_CR20","doi-asserted-by":"crossref","unstructured":"Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proceedings of IEEE WCNC, pp. 653\u2013658 (2011)","DOI":"10.1109\/WCNC.2011.5779210"},{"key":"611_CR21","doi-asserted-by":"crossref","unstructured":"Yan, G., Qiao, D.: Multi-round sensor deployment for guaranteed barrier coverage. In: Proceedings of IEEE INFOCOM\u201910, pp. 2462\u20132470 (2010)","DOI":"10.1109\/INFCOM.2010.5462074"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00611-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00611-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00611-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T23:10:03Z","timestamp":1595891403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00611-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["611"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00611-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,7,29]]},"assertion":[{"value":"23 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}