@inproceedings{5a5ba0c542d649a4a48ed56813c15a70,
title = "Barrier Coverage Problem in 2D",
abstract = " This paper deals with the NP-hard problem of covering a line segment by n initially arbitrarily arranged circles on the plane by moving their centers to the segment in such a way that the sum of the Euclidean distances between the initial and final positions of the centers of the disks would be minimal. In the case of identical circles, a dynamic programming algorithm is known, which constructs a –approximate solution to the problem with O(n 4 ) –time complexity. In this paper, we propose a new algorithm that has the same accuracy, but the complexity of which is reduced by n 2 times to O(nn 2 ). ",
keywords = "Barrier coverage, Mobile sensors, Sensor networks",
author = "Adil Erzin and Natalya Lagutkina",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-14094-6_8",
language = "English",
isbn = "9783030140939",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "118--130",
editor = "Danny Hughes and Seth Gilbert and Bhaskar Krishnamachari",
booktitle = "Algorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Revised Selected Papers",
address = "Germany",
note = "14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018 ; Conference date: 23-08-2018 Through 24-08-2018",
}