{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:56:53Z","timestamp":1742921813500,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_17","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"196-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Weak Coverage of a Rectangular Barrier"],"prefix":"10.1007","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":"Jan","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunil","family":"Shende","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":[[2017,4,14]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"47","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), 47\u201385 (2017). doi:10.1007\/s00453-016-0153-8","journal-title":"Algorithmica"},{"key":"17_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":"17_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":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Wiedermann, J., Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200\u2013209. Springer, Heidelberg (1999). doi:10.1007\/3-540-48523-6_17"},{"issue":"52","key":"17_CR5","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. TCS 410(52), 5515\u20135528 (2009)","journal-title":"TCS"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-31155-0_16","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"DZ Chen","year":"2012","unstructured":"Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 177\u2013188. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31155-0_16"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-04383-3_15","volume-title":"Ad-Hoc, Mobile and Wireless Networks","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., et al.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194\u2013212. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04383-3_15"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-14785-2_3","volume-title":"Ad-Hoc, Mobile and Wireless Networks","author":"J Czyzowicz","year":"2010","unstructured":"Czyzowicz, J., et al.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29\u201342. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14785-2_3"},{"key":"17_CR9","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. Theoret. Comput. Sci. 579, 64\u201373 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-09620-9_19","volume-title":"Structural Information and Communication Complexity","author":"M Eftekhari","year":"2014","unstructured":"Eftekhari, M., Flocchini, P., Narayanan, L., Opatrny, J., Santoro, N.: Distributed barrier coverage with relocatable sensors. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 235\u2013249. Springer, Cham (2014). doi:10.1007\/978-3-319-09620-9_19"},{"issue":"5","key":"17_CR11","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":"17_CR12","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":"17_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"17_CR14","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":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-28472-9_3","volume-title":"Algorithms for Sensor Systems","author":"E Kranakis","year":"2015","unstructured":"Kranakis, E., Krizanc, D., Luccio, F.L., Smith, B.: Maintaining intruder detection capability in a rectangular domain with sensors. In: Bose, P., G\u0105sieniec, L.A., R\u00f6mer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 27\u201340. Springer, Cham (2015). doi:10.1007\/978-3-319-28472-9_3"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 284\u2013298 (2005)","DOI":"10.1145\/1080829.1080859"},{"key":"17_CR17","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."},{"key":"17_CR18","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":"17_CR19","doi-asserted-by":"crossref","unstructured":"Yan, G., Qiao, D.: Multi-round sensor deployment for guaranteed barrier coverage. In: Proceedings of IEEE INFOCOM 2010, pp. 2462\u20132470 (2010)","DOI":"10.1109\/INFCOM.2010.5462074"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Kranakis, E., Krizanc, D., Lafond, M., Manuch, J., Narayanan, L., Opatrny, J., Stacho, L.: Weak coverage of a rectangular barrier. arXiv 1701.07294 (2017)","DOI":"10.1007\/978-3-319-57586-5_17"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:48:35Z","timestamp":1710341315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}