Barrier Coverage Problem in 2D

Adil Erzin, Natalya Lagutkina

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

4 Citations (Scopus)

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 ).

Original languageEnglish
Title of host publicationAlgorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Revised Selected Papers
EditorsDanny Hughes, Seth Gilbert, Bhaskar Krishnamachari
PublisherSpringer-Verlag GmbH and Co. KG
Pages118-130
Number of pages13
ISBN (Print)9783030140939
DOIs
Publication statusPublished - 1 Jan 2019
Event14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018 - Helsinki, Finland
Duration: 23 Aug 201824 Aug 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11410 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018
CountryFinland
CityHelsinki
Period23.08.201824.08.2018

Keywords

  • Barrier coverage
  • Mobile sensors
  • Sensor networks

Fingerprint Dive into the research topics of 'Barrier Coverage Problem in 2D'. Together they form a unique fingerprint.

Cite this