{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:21:00Z","timestamp":1775067660037,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T00:00:00Z","timestamp":1602288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T00:00:00Z","timestamp":1602288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11590-020-01650-8","type":"journal-article","created":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T21:02:23Z","timestamp":1602363743000},"page":"1397-1406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["FPTAS for barrier covering problem with equal touching circles in 2D"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2183-523X","authenticated-orcid":false,"given":"Adil","family":"Erzin","sequence":"first","affiliation":[]},{"given":"Natalya","family":"Lagutkina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,10]]},"reference":[{"issue":"3","key":"1650_CR1","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"PK Agarwal","year":"2006","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 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1650_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":"1650_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Rawitz, D., Terlecky, P.: \u201cGreen\u201d barrier coverage with mobile sensors. In: Algorithms and Complexity: Proceedings of the 9th International Conference, CIAC 2015, Paris, France, pp. 33\u201346. Springer (2015)","DOI":"10.1007\/978-3-319-18173-8_2"},{"key":"1650_CR4","doi-asserted-by":"crossref","unstructured":"Benkoczi, R., Friggstad, Z., Gaur, D., Thom, M.: Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line. In: Proc. of the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, vol. 9536, pp. 98\u2013111. LNCS (2015)","DOI":"10.1007\/978-3-319-28472-9_8"},{"issue":"52","key":"1650_CR5","doi-asserted-by":"publisher","first-page":"5515","DOI":"10.1016\/j.tcs.2009.07.007","volume":"410","author":"BK Bhattacharya","year":"2008","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 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1650_CR6","first-page":"26","volume-title":"Approximation and Online Algorithms, WAOA 2017, LNCS","author":"P Carmi","year":"2017","unstructured":"Carmi, P., Katz, M.J., Saban, R., Stein, Y.: Improved PTASs for convex barrier coverage. In: Solis-Oba, R., Fleischer, R. (eds.) Approximation and Online Algorithms, WAOA 2017, LNCS, vol. 10787, pp. 26\u201340. Springer, Cham (2017)"},{"key":"1650_CR7","doi-asserted-by":"crossref","unstructured":"Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking, pp. 63\u201374 (2007)","DOI":"10.1145\/1287853.1287862"},{"key":"1650_CR8","doi-asserted-by":"crossref","unstructured":"Chen, A., Lai, T.H., Xuan, D.: Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks. In: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 421\u2013430 (2008)","DOI":"10.1145\/1374618.1374674"},{"key":"1650_CR9","first-page":"57","volume-title":"ALGOSENSORS 2017, LNCS","author":"A Cherry","year":"2017","unstructured":"Cherry, A., Gudmundsson, J., Mestre, J.: Barrier coverage with uniform radii in 2D. In: Fernandez, Anta A., et al. (eds.) ALGOSENSORS 2017, LNCS, vol. 10718, pp. 57\u201369. Springer, Cham (2017)"},{"key":"1650_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-14785-2_3","volume-title":"Ad-Hoc, Mobile and Wireless Networks, LNSC","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.) Ad-Hoc, Mobile and Wireless Networks, LNSC, vol. 6288, pp. 29\u201342. Springer, Berlin, Heidelberg (2010)"},{"key":"1650_CR11","first-page":"118","volume-title":"ALGOSENSORS 2018, LNCS","author":"A Erzin","year":"2019","unstructured":"Erzin, A., Lagutkina, N.: Barrier coverage problem in 2D. In: Gilbert, S., et al. (eds.) ALGOSENSORS 2018, LNCS, vol. 11410, pp. 118\u2013130. Springer, Berlin, Heidelberg (2019)"},{"key":"1650_CR12","doi-asserted-by":"crossref","unstructured":"Erzin, A., Lagutkina, N., Ioramishvili, N.: Barrier covering in 2D using mobile sensors with circular coverage areas. In: Matsatsinis, N.F., et al. (eds.) LION 2019, LNCS, vol. 11968, pp. 342\u2013354. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-38629-0_28"},{"issue":"1","key":"1650_CR13","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(1), 14 (2014)","journal-title":"ACM Trans. Sens. Netw."},{"key":"1650_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H Kuhn","year":"1955","unstructured":"Kuhn, H.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"1650_CR15","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Saunders College Publishing, Fort Worth (1976)"},{"issue":"4","key":"1650_CR16","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.adhoc.2010.10.002","volume":"11","author":"A Saipulla","year":"2010","unstructured":"Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier coverage with line-based deployed mobile sensors. Ad Hoc Netw. 11(4), 1381\u20131391 (2010)","journal-title":"Ad Hoc Netw."},{"key":"1650_CR17","unstructured":"Thom, M.: Investigation on two classes of covering problems. Ph.D. thesis, University of Lethbridge, Canada (2017)"},{"key":"1650_CR18","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"P Vaidya","year":"1989","unstructured":"Vaidya, P.: Geometry helps in matching. SIAM J. Comput. 18, 1201\u20131225 (1989)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"1650_CR19","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s11704-016-5532-4","volume":"10","author":"F Wu","year":"2016","unstructured":"Wu, F., Gui, Y., Wang, Z., Gao, X., Chen, G.: A survey on barrier coverage with sensors. Front. Comput. Sci. 10(6), 968\u2013984 (2016)","journal-title":"Front. Comput. Sci."},{"key":"1650_CR20","unstructured":"Zhang, X.: Algorithms for barrier coverage with wireless sensors. Ph.D. thesis, City University of Hong Kong, Hong Kong (2016)"},{"key":"1650_CR21","doi-asserted-by":"publisher","unstructured":"Zhao, L., Bai, G., Shen, H., Tang, Z.: Strong barrier coverage of directional sensor networks with mobile sensors. Int. J. Distrib. Sens. Netw. 14(2) (2018). https:\/\/doi.org\/10.1177\/1550147718761582","DOI":"10.1177\/1550147718761582"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01650-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01650-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01650-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:02:11Z","timestamp":1633914131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01650-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,10]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1650"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01650-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,10]]},"assertion":[{"value":"9 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}