{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:21:04Z","timestamp":1775067664689,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662489703","type":"print"},{"value":"9783662489710","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_17","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"188-198","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing the Maximum Moving Cost of Interval Coverage"],"prefix":"10.1007","author":[{"given":"Haitao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-21840-3_3","volume-title":"Algorithms and Data Structures","author":"AM Andrews","year":"2015","unstructured":"Andrews, A.M., Wang, H.: Minimizing the aggregate movements for interval coverage. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 28\u201339. Springer, Heidelberg (2015)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s00453-013-9853-5","volume":"72","author":"A Bar-Noy","year":"2015","unstructured":"Bar-Noy, A., Baumer, B.: Average case network lifetime on an interval with adjustable sensing ranges. Algorithmica 72, 148\u2013166 (2015)","journal-title":"Algorithmica"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-40450-4_9","volume-title":"Algorithms \u2013 ESA 2013","author":"A Bar-Noy","year":"2013","unstructured":"Bar-Noy, A., Rawitz, D., Terlecky, P.: Maximizing barrier coverage lifetime with mobile sensors. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 97\u2013108. Springer, Heidelberg (2013)"},{"key":"17_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry \u2013 Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry \u2013 Algorithms and Applications, 3rd edn. Springer-Verlag, Berlin (2008)","edition":"3"},{"key":"17_CR5","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."},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R Cole","year":"1989","unstructured":"Cole, R., Salowe, J., Steiger, W., Szemer\u00e9di, E.: An optimal-time algorithm for slope selection. SIAM J. Comput. 18(4), 792\u2013810 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR7","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"17_CR8","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., 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: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194\u2013212. Springer, Heidelberg (2009)"},{"key":"17_CR9","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., 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: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29\u201342. Springer, Heidelberg (2010)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2629518","volume":"11","author":"H Fan","year":"2014","unstructured":"Fan, H., Li, M., Sun, X., Wan, P., Zhao, Y.: Barrier coverage by sensors with adjustable ranges. ACM Trans. Sens. Netw. 11, 14 (2014)","journal-title":"ACM Trans. Sens. Netw."},{"issue":"4","key":"17_CR11","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. J. ACM 30(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"key":"17_CR12","unstructured":"Mehrandish, M.: On routing, backbone formation and barrier coverage in wireless Ad Hoc and sensor networks. Ph.D. thesis, Concordia University, Montreal, Quebec, Canada (2011)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), pp. 653\u2013658 (2011)","DOI":"10.1109\/WCNC.2011.5779210"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T22:44:15Z","timestamp":1599864255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}