Approximation algorithm for distance constraint sweep coverage without predetermined base stations
暂无分享,去创建一个
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...
[1] Barun Gorain,et al. Approximation algorithm for sweep coverage on graph , 2015, Inf. Process. Lett..
[2] Esther M. Arkin,et al. Approximations for minimum and min-max vehicle routing problems , 2006, J. Algorithms.
[3] Barun Gorain,et al. Solving energy issues for sweep coverage in wireless sensor networks , 2017, Discret. Appl. Math..
[4] Yunhao Liu,et al. Sweep Coverage with Mobile Sensors , 2011, IEEE Trans. Mob. Comput..