Approximation algorithms for distance constraint sweep coverage with base stations

Jian Liang, Xiaohui Huang and Zhao Zhang ()
Additional contact information
Jian Liang: Zhejiang Normal University
Xiaohui Huang: Zhejiang Normal University
Zhao Zhang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 4, No 2, 1125 pages

Abstract: Abstract In this paper, we study the minimum distance constraint sweep coverage problem (MinSDCSC), the goal of which is to find the minimum number of mobile sensors and their trajectories such that each static sensor is visited at least once by some mobile sensor every required time interval and every mobile sensor visits a base station before running out of its energy (suppose every replenishment of energy can support a continuous movement of distance D). For the case when there is only one base station, we present an asymptotically $$\frac{\alpha \beta }{\beta -2}$$ α β β - 2 -approximation algorithm for the problem on a graph with a metric distance function, and a 2-approximation algorithm for the problem on a tree metric, where $$\alpha $$ α is the approximation ratio for the traveling salesman problem and $$\beta $$ β is the ratio between D and the distance from the base station to the farthest static sensor. For the case where there are k base stations, we show that there exists an algorithm with approximation factor at most $$k\gamma $$ k γ where $$\gamma $$ γ is the approximation ratio for the problem with one base station.

Keywords: Distance constraint; Sweep coverage; Vehicle routing; Approximation algorithm (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0341-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0341-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0341-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().