An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...