{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T13:54:20Z","timestamp":1723211660787},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:00:00Z","timestamp":1557446400000},"content-version":"vor","delay-in-days":1470,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100006109","name":"VEGA","doi-asserted-by":"publisher","award":["2\/0136\/12"],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SEP-CONACYT"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1016\/j.tcs.2015.02.006","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T20:33:32Z","timestamp":1424291612000},"page":"64-73","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":44,"special_numbering":"C","title":["Complexity of barrier coverage with relocatable sensors in the plane"],"prefix":"10.1016","volume":"579","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0914-2983","authenticated-orcid":false,"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[]},{"given":"Mohsen","family":"Eftekhari","sequence":"additional","affiliation":[]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"Sunil","family":"Shende","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2015.02.006_br0010","series-title":"Proceedings of MobiCom '07","first-page":"75","article-title":"Reliable density estimates for coverage and connectivity in thin strips of finite length","author":"Balister","year":"2007"},{"key":"10.1016\/j.tcs.2015.02.006_br0020","series-title":"Proceedings of Algorithms","first-page":"97","article-title":"Maximizing barrier coverage lifetime with mobile sensors","volume":"vol. 8125","author":"Bar-Noy","year":"2013"},{"issue":"52","key":"10.1016\/j.tcs.2015.02.006_br0030","doi-asserted-by":"crossref","first-page":"5515","DOI":"10.1016\/j.tcs.2009.07.007","article-title":"Optimal movement of mobile sensors for barrier coverage of a planar region","volume":"410","author":"Bhattacharya","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2015.02.006_br0040","series-title":"Proceedings of COCOA '08","first-page":"103","article-title":"Optimal movement of mobile sensors for barrier coverage of a planar region","author":"Bhattacharya","year":"2008"},{"key":"10.1016\/j.tcs.2015.02.006_br0050","series-title":"Proceedings of SWAT '12","first-page":"177","article-title":"Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain","author":"Chen","year":"2012"},{"key":"10.1016\/j.tcs.2015.02.006_br0060","series-title":"Proceedings of ADHOC-NOW","first-page":"194","article-title":"On minimizing the maximum sensor movement for barrier coverage of a line segment","volume":"vol. 5793","author":"Czyzowicz","year":"2009"},{"key":"10.1016\/j.tcs.2015.02.006_br0070","series-title":"Proceedings of ADHOC-NOW","first-page":"29","article-title":"On minimizing the sum of sensor movements for barrier coverage of a line segment","volume":"vol. 6288","author":"Czyzowicz","year":"2010"},{"key":"10.1016\/j.tcs.2015.02.006_br0080","series-title":"Proceedings of CIAC 2013 Conference","first-page":"170","article-title":"Complexity of barrier coverage with relocatable sensors in the plane","volume":"vol. 7878","author":"Dobrev","year":"2013"},{"key":"10.1016\/j.tcs.2015.02.006_br0090","series-title":"Proceeding of ACM PODC Symposium","first-page":"383","article-title":"Distributed local algorithms for barrier coverage using relocatable sensors","author":"Eftekhari","year":"2013"},{"key":"10.1016\/j.tcs.2015.02.006_br0100","series-title":"Proceedings of 10th IEEE MASS","first-page":"310","article-title":"On multi-round sensor deployment for barrier coverage","author":"Eftekhari","year":"2013"},{"key":"10.1016\/j.tcs.2015.02.006_br0110","series-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","year":"1990"},{"issue":"3","key":"10.1016\/j.tcs.2015.02.006_br0120","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1987","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2015.02.006_br0130","series-title":"Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications","first-page":"115","article-title":"The coverage problem in a wireless sensor network","author":"Huang","year":"2003"},{"key":"10.1016\/j.tcs.2015.02.006_br0140","series-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures","first-page":"73","article-title":"Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract","author":"Kranakis","year":"2013"},{"key":"10.1016\/j.tcs.2015.02.006_br0150","series-title":"Proceedings of MobiCom '05","first-page":"284","article-title":"Barrier coverage with wireless sensors","author":"Kumar","year":"2005"},{"key":"10.1016\/j.tcs.2015.02.006_br0160","series-title":"Proceedings of INFOCOM","first-page":"1380","article-title":"Coverage problems in wireless ad-hoc sensor networks","volume":"vol. 3","author":"Meguerdichian","year":"2001"},{"key":"10.1016\/j.tcs.2015.02.006_br0170","series-title":"Proceedings of IEEE WCNC '11","first-page":"1464","article-title":"Minimizing the number of sensors moved on line barriers","author":"Mehrandish","year":"2011"},{"key":"10.1016\/j.tcs.2015.02.006_br0180","series-title":"Proceedings of International Symposium on Parallel Architectures, Algorithms, and Networks","first-page":"99","article-title":"Barrier coverage with mobile sensors","author":"Shen","year":"2008"},{"key":"10.1016\/j.tcs.2015.02.006_br0190","series-title":"Proceedings of Frontiers of Algorithmics Workshop","first-page":"327","article-title":"New algorithms for barrier coverage with mobile sensors","volume":"vol. 6213","author":"Tan","year":"2010"},{"key":"10.1016\/j.tcs.2015.02.006_br0200","series-title":"Proceedings of IEEE INFOCOM '10","first-page":"2462","article-title":"Multi-round sensor deployment for guaranteed barrier coverage","author":"Yan","year":"2010"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515001036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515001036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T08:40:55Z","timestamp":1565426455000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515001036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":20,"alternative-id":["S0304397515001036"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.02.006","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity of barrier coverage with relocatable sensors in the plane","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.02.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}