{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:55:54Z","timestamp":1743116154043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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-62127-2_45","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"533-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Covering Multiple Barriers"],"prefix":"10.1007","author":[{"given":"Shimin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-016-0153-8","volume":"78","author":"A Andrews","year":"2017","unstructured":"Andrews, A., Wang, H.: Minimizing the aggregate movements for interval coverage. Algorithmica 78, 47\u201385 (2017)","journal-title":"Algorithmica"},{"issue":"52","key":"45_CR2","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, B., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science 410(52), 5515\u20135528 (2009)","journal-title":"Theoretical Computer Science"},{"key":"45_CR3","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 and Computational Geometry 50, 374\u2013408 (2013)","journal-title":"Discrete and Computational Geometry"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00453-013-9857-1","volume":"72","author":"D Chen","year":"2013","unstructured":"Chen, D., Tan, X., Wang, H., Wu, G.: Optimal point movement for covering circular regions. Algorithmica 72, 379\u2013399 (2013)","journal-title":"Algorithmica"},{"key":"45_CR5","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":"45_CR6","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":"45_CR7","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. Theoretical Computer Science 579, 64\u201373 (2015)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G Frederickson","year":"1984","unstructured":"Frederickson, G., Johnson, D.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing 13(1), 14\u201330 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. In: Proc. of the 11th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 284\u2013298 (2005)","DOI":"10.1145\/1080829.1080859"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Li, S., Shen, H.: Minimizing the maximum sensor movement for barrier coverage in the plane. In: Proc. of the 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 244\u2013252 (2015)","DOI":"10.1109\/INFOCOM.2015.7218388"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Li, S., Wang, H.: Algorithms for covering multiple barriers. arXiv:1704.06870 (2017)","DOI":"10.1007\/978-3-319-62127-2_45"},{"issue":"4","key":"45_CR12","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30(4), 852\u2013865 (1983)","journal-title":"Journal of the ACM"},{"key":"45_CR13","unstructured":"Mehrandish, M.: On Routing, Backbone Formation and Barrier Coverage in Wireless Ad Doc and Sensor Networks. Ph.D. thesis, Concordia University, Montreal, Quebec, Canada (2011)"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), pp. 653\u2013658 (2011)","DOI":"10.1109\/WCNC.2011.5779210"},{"key":"45_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-662-48971-0_17","volume-title":"Algorithms and Computation","author":"H Wang","year":"2015","unstructured":"Wang, H., Zhang, X.: Minimizing the maximum moving cost of interval coverage. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 188\u2013198. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48971-0_17. Full version to appear in International Journal of Computational Geometry and Application (IJCGA)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:18:49Z","timestamp":1709828329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_45","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":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}