Approximation algorithm for distance constraint sweep coverage without predetermined base stations-Reference-Cited by-同舟云学术

Approximation algorithm for distance constraint sweep coverage without predetermined base stations

Published:2018-10 Issue:05 Volume:10 Page:1850064
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Chen Qingqing¹,Huang Xiaohui¹,Ran Yingli¹

Affiliation:

1. College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China

Abstract

In a sweep-coverage problem, each point of interest should be visited at least once by some mobile sensor every required time interval. Because of energy constraint, each mobile sensor has to visit a base station for replenishment before running out of its power. We model the problem as a distance constraint sweep-coverage problem the goal of which is to minimize the sum of the number of mobile sensors and the number of base stations used to meet the requirements. This paper presents an approximation algorithm with a guaranteed approximation ratio 7.

Funder

National Natural Science Foundation of China

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830918500647

Reference4 articles.

1. Approximations for minimum and min-max vehicle routing problems

2. Sweep Coverage with Mobile Sensors

3. Approximation algorithm for sweep coverage on graph

4. Solving energy issues for sweep coverage in wireless sensor networks

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm for partial sweep coverage on a line;Discrete Applied Mathematics;2024-12

2. Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints;Combinatorial Optimization and Applications;2023-12-09

3. A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems;Optimization Letters;2023-05-22

4. Approximation algorithm for prize-collecting sweep cover with base stations;Theoretical Computer Science;2022-09

5. Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations;Algorithmic Aspects in Information and Management;2021