Approximation algorithm for dominating sweep cover

In a sweep coverage problem, mobile sensors periodically and timely visit Points of Interest (PoIs) to collect information. A PoI is said to be sweep-covered if it is visited at least once within every time period [Formula: see text]. This paper proposes a new variant: the Dominating Sweep Cover (DSC) problem, which aims to monitor all nodes by periodically visiting a dominating set of the network using the minimum number of mobile sensors. By leveraging the relation between the DSC problem and the Group Steiner Tree (GST) problem, we design an approximation algorithm for DSC with an approximation ratio of [Formula: see text], where [Formula: see text] is the number of nodes in the network.