Given a set P of n points in the plane, we consider the problem of covering P with a minimum
number of unit disks. This problem is known to be NP-hard. We present a simple 4 …

Given a set of n points in the plane, the Unit Disk Cover (UDC) problem asks to compute the
minimum number of unit disks required to cover the points, along with a placement of the …

Given a set of points in the plane, the Unit Disk Cover (UDC) problem asks to compute the
minimum number of unit disks required to cover the points, along with a placement of the …

Multiple coverage with unit disks is a problem widely seen in monitoring applications of
wireless sensor networks. In this problem, let T= t 1, t 2,…, tn be a set of targets to be …

Effective monitoring of applications in wireless sensor networks can be underpinned by the
multiple coverage problem with unit disks. In the problem, we are given a set of targets T={t …

In this paper, we address the cardinality constrained covering with unit balls problem: given
a positive integer L and a set of n points in R d, partition them into a minimum number of …

In this paper we present a polynomial time approximation scheme for the most points
covering problem. In the most points covering problem, n points in R 2, r> 0, and an integer …

The relay node placement problem in wireless sensor network (WSN) aims at deploying the
minimum number of relay nodes over the network so that each sensor can communicate …

In the relay placement problem, given a set of static sensors and relay range r≥ 1, we must
place a minimum number of static relays such that any two sensors can communicate via the …

In geometric covering problems, the aim is to cover a set of given points using a minimum
number of shapes with prescribed properties. These problems extend in many ways such as …