{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:31:19Z","timestamp":1760441479289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319894409"},{"type":"electronic","value":"9783319894416"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-89441-6_3","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"26-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved PTASs for Convex Barrier Coverage"],"prefix":"10.1007","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Rachel","family":"Saban","sequence":"additional","affiliation":[]},{"given":"Yael","family":"Stein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"PK Agarwal","year":"1999","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912\u2013953 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR2","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)","journal-title":"Algorithmica"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"CL Bajaj","year":"1988","unstructured":"Bajaj, C.L.: The algebraic degree of geometric optimization problems. Discret. Comput. Geom. 3, 177\u2013191 (1988)","journal-title":"Discret. Comput. Geom."},{"issue":"52","key":"3_CR4","doi-asserted-by":"publisher","first-page":"5515","DOI":"10.1016\/j.tcs.2009.07.007","volume":"410","author":"BK Bhattacharya","year":"2009","unstructured":"Bhattacharya, B.K., 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":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0925-7721(02)00102-5","volume":"24","author":"P Bose","year":"2003","unstructured":"Bose, P., Maheshwari, A., Morin, P.: Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3), 135\u2013146 (2003)","journal-title":"Comput. Geom."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chen, A., Kumar, S., Lai, T.: Designing localized algorithms for barrier coverage. In: Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, MOBICOM 2007, pp. 63\u201374 (2007)","DOI":"10.1145\/1287853.1287862"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s00454-013-9525-x","volume":"50","author":"DZ Chen","year":"2013","unstructured":"Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discret. Comput. Geom. 50(2), 374\u2013408 (2013)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00453-013-9857-1","volume":"72","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Tan, X., Wang, H., Wu, G.: Optimal point movement for covering circular regions. Algorithmica 72(2), 379\u2013399 (2015)","journal-title":"Algorithmica"},{"key":"3_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., Hesari, M.E., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.M., Urrutia, J.: Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579, 64\u201373 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s11276-006-9856-0","volume":"13","author":"S Kumar","year":"2007","unstructured":"Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. Wirel. Netw. 13(6), 817\u2013834 (2007)","journal-title":"Wirel. Netw."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Sharathkumar, R., Agarwal, P.K.: A near-linear time $$\\epsilon $$-approximation algorithm for geometric bipartite matching. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 385\u2013394 (2012)","DOI":"10.1145\/2213977.2214014"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89441-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:19:34Z","timestamp":1710245974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 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":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}