{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T01:14:51Z","timestamp":1726017291802},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_19","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"313-324","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary"],"prefix":"10.1007","author":[{"given":"Peihuang","family":"Huang","sequence":"first","affiliation":[]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"issue":"52","key":"19_CR1","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."},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s00454-013-9525-x","volume":"50","author":"D Chen","year":"2013","unstructured":"Chen, D., Yan, G., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discrete Comput. Geom. 50(2), 374\u2013408 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-72751-6_5","volume-title":"Algorithms for Sensor Systems","author":"A Cherry","year":"2017","unstructured":"Cherry, A., Gudmundsson, J., Mestre, J.: Barrier coverage with uniform radii in 2D. In: Fern\u00e1ndez Anta, A., Jurdzinski, T., Mosteiro, M.A., Zhang, Y. (eds.) ALGOSENSORS 2017. LNCS, vol. 10718, pp. 57\u201369. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72751-6_5"},{"key":"19_CR4","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). https:\/\/doi.org\/10.1007\/978-3-642-04383-3_15"},{"key":"19_CR5","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). https:\/\/doi.org\/10.1007\/978-3-642-14785-2_3"},{"key":"19_CR6","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., et al.: Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579, 64\u201373 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Gage, D.W.: Command control for many-robot systems. Technical report, Naval Command Control and Ocean Surveillance Center RDT and E Div, San Diego, CA (1992)","DOI":"10.21236\/ADA422540"},{"key":"19_CR8","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. ACM (2005)","DOI":"10.1145\/1080829.1080859"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Li, S., Shen, H.: Minimizing the maximum sensor movement for barrier coverage in the plane. In: IEEE Conference on Computer Communications (INFOCOM), pp. 244\u2013252. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218388"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1394555.1394565","volume":"12","author":"X Li","year":"2008","unstructured":"Li, X., Frey, H., Santoro, N., Stojmenovic, I.: Localized sensor self-deployment with coverage guarantee. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(2), 50\u201352 (2008)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: IEEE Wireless Communications and Networking Conference (WCNC), pp. 653\u2013658. IEEE (2011)","DOI":"10.1109\/WCNC.2011.5779210"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-14553-7_31","volume-title":"Frontiers in Algorithmics","author":"X Tan","year":"2010","unstructured":"Tan, X., Wu, G.: New algorithms for barrier coverage with mobile sensors. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 327\u2013338. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14553-7_31"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:09:28Z","timestamp":1709824168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","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":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}