Add to ORKGGiven 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 the best previous practical solution is a 38-approximation algorithm by Carmi et al. [5]. We first consider the line-separable discrete unit disk cover problem (the set of disk centers can be separated from the set of points by a line) for which we present an O(n(logn+m))-time algorithm that finds an exact solution. Combining our line-separable algorithm with techniques from the algorithm of Carmi et al. [5] result
We give an improved approximation algorithm for the unique unit-disk coverage problem: Given a set o...
Usually the covering problem requires all elements in a system to be covered. In some situations, it...
Usually the covering problem requires all elements in a system to be covered. In some situations, it...
Abstract. Given m unit disks and n points in the plane, the discrete unit disk cover problem is to s...
Abstract. Given m unit disks and n points in the plane, the discrete unit disk cover problem is to s...
Abstract. Given a set P of n points and a set D of m unit disks on a 2-dimensional plane, the discre...
We investigate the Within-Strip Discrete Unit Disk Cover problem (WSDUDC), where one wishes to find ...
Given a set P of n points in the plane, we consider the problem of covering P with a minimum number ...
We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which is a restric...
The following planar minimum disk cover problem is considered in this paper: given a set D of n disk...
Given a set P of n points and a set S of m weighted disks in the plane, the disk coverage problem as...
We present a polynomial time algorithm for the unit disk covering problem with an approximation fact...
Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which s...
Let P be a set of n weighted points. We study approximation algorithms for the following two continu...
AbstractWe study the following problem: Given a set of red points and a set of blue points on the pl...
We give an improved approximation algorithm for the unique unit-disk coverage problem: Given a set o...
Usually the covering problem requires all elements in a system to be covered. In some situations, it...
Usually the covering problem requires all elements in a system to be covered. In some situations, it...
Abstract. Given m unit disks and n points in the plane, the discrete unit disk cover problem is to s...
Abstract. Given m unit disks and n points in the plane, the discrete unit disk cover problem is to s...
Abstract. Given a set P of n points and a set D of m unit disks on a 2-dimensional plane, the discre...
We investigate the Within-Strip Discrete Unit Disk Cover problem (WSDUDC), where one wishes to find ...
Given a set P of n points in the plane, we consider the problem of covering P with a minimum number ...
We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which is a restric...
The following planar minimum disk cover problem is considered in this paper: given a set D of n disk...
Given a set P of n points and a set S of m weighted disks in the plane, the disk coverage problem as...
We present a polynomial time algorithm for the unit disk covering problem with an approximation fact...
Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which s...
Let P be a set of n weighted points. We study approximation algorithms for the following two continu...
AbstractWe study the following problem: Given a set of red points and a set of blue points on the pl...
We give an improved approximation algorithm for the unique unit-disk coverage problem: Given a set o...
Usually the covering problem requires all elements in a system to be covered. In some situations, it...
Usually the covering problem requires all elements in a system to be covered. In some situations, it...