Given a set P of n points and a set D of m unit disks on a 2-dimensional plane, the discrete unit disk cover (DUDC) problem is (i) to check whether each point in P is covered by at least one disk inâ€¦ (More)

In the unbounded version of the range assignment problem for all-to-all communication in ID, a set of n radio-stations are placed arbitrarily on a line; the objective is to assign ranges to theseâ€¦ (More)

In this note, we shall consider constant factor approximation algorithms for a variation of the discrete piercing set problem for unit disks. Here a set of points P is given; the objective is toâ€¦ (More)

Given a set V of n sensor node distributed on a 2-dimensional plane and a source node s âˆˆ V, the interference problem deals with assigning transmission range to each v âˆˆ V such that the members in Vâ€¦ (More)

Given a set D of m unit disks and a set P of n points in the plane, the discrete unit disk cover problem is to select a minimum cardinality subset Dâ€² âŠ† D to cover P. This problem is NP-hard [14] andâ€¦ (More)

Given a set S of n radio-stations located on a d-dimensional space, a source node s (âˆˆ S) and an integer h (1 h n âˆ’ 1), the h-hop broadcast range assignment problem deals with assigning ranges to theâ€¦ (More)