268 citations · 743 across the 33 of their papers we have counts for
6 papers · 1 filter
Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane
Longkun Guo, Hong Shen
Given a line barrier and a set of mobile sensors distributed in the plane, the Minimizing Maximum Sensor Movement problem (MMSM) for \textcolor{black}{line barrier coverage} is to…
Point Sweep Coverage on Path
Dieyan Liang, Hong Shen
An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sw…
Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval
Longkun Guo, Hong Shen, Wenxing Zhu
In a mobile network, wireless data broadcast over channels (frequencies) is a powerful means for distributed dissemination of data to clients who access the channels through mu…
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
Longkun Guo, Hong Shen, Kewen Liao
For a given graph with positive integral cost and delay on edges, distinct vertices and , cost bound and delay bound , the bi-constraint pat…
Constrained Fault-Tolerant Resource Allocation
Kewen Liao, Hong Shen, Longkun Guo
In the Constrained Fault-Tolerant Resource Allocation (FTRA) problem, we are given a set of sites containing facilities as resources, and a set of clients accessing these resources…
Unconstrained and Constrained Fault-Tolerant Resource Allocation
Kewen Liao, Hong Shen
First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in \cite{shihongftfa}). In the problem, we are given a set of sites equipp…