{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:26:44Z","timestamp":1760441204034},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T00:00:00Z","timestamp":1387324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00453-013-9857-1","type":"journal-article","created":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T15:35:21Z","timestamp":1387294521000},"page":"379-399","source":"Crossref","is-referenced-by-count":16,"title":["Optimal Point Movement for Covering Circular Regions"],"prefix":"10.1007","volume":"72","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xuehou","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Gangshan","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,18]]},"reference":[{"issue":"4","key":"9857_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"I. Akyildiz","year":"2002","unstructured":"Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw. 38(4), 393\u2013422 (2002)","journal-title":"Comput. Netw."},{"issue":"52","key":"9857_CR2","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 410(52), 5515\u20135528 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9857_CR3","first-page":"160","volume-title":"Proc. of the 14th Conference on Annual European Symposium on Algorithms","author":"D. Bremner","year":"2006","unstructured":"Bremner, D., Chan, T.M., Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Taslakian, P.: Necklaces, convolutions, and X + Y. In: Proc. of the 14th Conference on Annual European Symposium on Algorithms, pp.\u00a0160\u2013171 (2006)"},{"key":"9857_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-540-74456-6_37","volume-title":"Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science","author":"G. Brodal","year":"2007","unstructured":"Brodal, G., Georgiadis, L., Hansen, K.A., Katriel, I.: Dynamic matchings in convex bipartite graphs. In: Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol.\u00a04708, pp.\u00a0406\u2013417. Springer, Berlin (2007)"},{"issue":"1","key":"9857_CR5","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/S0097539794267243","volume":"27","author":"S. Buss","year":"1998","unstructured":"Buss, S., Yianilos, P.: Linear and O(nlogn) time minimum-cost matching algorithms for quasi-convex tours. SIAM J. Comput. 27(1), 170\u2013201 (1998)","journal-title":"SIAM J. Comput."},{"key":"9857_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01758842","volume":"8","author":"M.S. Chang","year":"1992","unstructured":"Chang, M.S., Tang, C.Y., Lee, R.C.T.: Solving the Euclidean bottleneck matching problem by k-relative neighborhood graphs. Algorithmica 8, 177\u2013194 (1992)","journal-title":"Algorithmica"},{"key":"9857_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1287853.1287862","volume-title":"Proc. of the 13th Annual ACM International Conference on Mobile Computing and Networking","author":"A. Chen","year":"2007","unstructured":"Chen, A., Kumar, S., Lai, T.: Designing localized algorithms for barrier coverage. In: Proc. of the 13th Annual ACM International Conference on Mobile Computing and Networking, pp. 63\u201373 (2007)"},{"issue":"2","key":"9857_CR8","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s00454-011-9338-8","volume":"46","author":"D.Z. Chen","year":"2011","unstructured":"Chen, D.Z., Wang, C., Wang, H.: Representing a functional curve by curves with fewer peaks. Discrete Comput. Geom. 46(2), 334\u2013360 (2011)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9857_CR9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"issue":"4","key":"9857_CR10","doi-asserted-by":"crossref","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":"9857_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195992000020","volume":"2","author":"M.B. Dillencourt","year":"1992","unstructured":"Dillencourt, M.B., Mount, D.M., Netanyahu, N.S.: A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. 2, 1\u201327 (1992)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9857_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0020-0190(00)00096-X","volume":"75","author":"A. Efrat","year":"2000","unstructured":"Efrat, A., Katz, M.J.: Computing Euclidean bottleneck matchings in higher dimensions. Inf. Process. Lett. 75, 169\u2013174 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9857_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A. Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., Katz, M.: Geometry helps in bottleneck matching and related problems. Algorithmica 31(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"9857_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H. Gabow","year":"1985","unstructured":"Gabow, H., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30, 209\u2013221 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"9857_CR15","unstructured":"Hu, S.: \u2018Virtual Fence\u2019 along border to be delayed. Washington Post, February 28, 2008"},{"issue":"3","key":"9857_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(93)90234-Z","volume":"47","author":"M. Katz","year":"1993","unstructured":"Katz, M., Sharir, M.: Optimal slope selection via expanders. Inf. Process. Lett. 47(3), 115\u2013122 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"9857_CR17","doi-asserted-by":"crossref","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":"9857_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(95)00145-3","volume":"56","author":"Y.D. Liang","year":"1995","unstructured":"Liang, Y.D., Blum, N.: Circular convex bipartite graphs: maximum matching and Hamiltonian circuits. Inf. Process. Lett. 56, 215\u2013219 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9857_CR19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski Jr.","year":"1981","unstructured":"Lipski, W. Jr., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Inform. 15(4), 329\u2013346 (1981)","journal-title":"Acta Inform."},{"key":"9857_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"39","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Randomized optimal algorithm for slope selection. Inf. Process. Lett. 39, 183\u2013187 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9857_CR21","doi-asserted-by":"crossref","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"},{"issue":"2","key":"9857_CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G. Steiner","year":"1996","unstructured":"Steiner, G., Yeomans, J.: A linear time algorithm for maximum matchings in convex, bipartite graphs. Comput. Math. Appl. 31(2), 91\u201396 (1996)","journal-title":"Comput. Math. Appl."},{"key":"9857_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-642-14553-7_31","volume-title":"Proc. of the 4th International Workshop on Frontiers in Algorithmics","author":"X. Tan","year":"2010","unstructured":"Tan, X., Wu, G.: New algorithms for barrier coverage with mobile sensors. In: Proc. of the 4th International Workshop on Frontiers in Algorithmics. Lecture Notes in Computer Science, vol.\u00a06213, pp.\u00a0327\u2013338. Springer, Berlin (2010)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9857-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9857-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9857-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T23:38:09Z","timestamp":1647733089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9857-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,18]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9857"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9857-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,18]]}}}