Add to ORKGWe present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on the method used. This is an improve-ment on the best known approximation factor of 108.
We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which is a restric...
Given a set D of m unit disks and a set P of n points in the plane, the discrete unit disk cover pro...
AbstractThis paper gives the first polynomial time approximation scheme for the connected vertex cov...
Given a set P of n points in the plane, we consider the problem of covering P with a minimum number ...
The following planar minimum disk cover problem is considered in this paper: given a set D of n disk...
Numerous approximation algorithms for unit disk graphs have been proposed in the literature, exhibit...
We present a basic theorem in combinatorial geometry that leads to a family of approximation algorit...
Abstract. Given a set P of n points and a set D of m unit disks on a 2-dimensional plane, the discre...
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...
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...
We investigate the Within-Strip Discrete Unit Disk Cover problem (WSDUDC), where one wishes to find ...
We give an improved approximation algorithm for the unique unit-disk coverage problem: Given a set o...
International audienceNumerous approximation algorithms for problems on unit disk graphs have been p...
We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which is a restric...
Given a set D of m unit disks and a set P of n points in the plane, the discrete unit disk cover pro...
AbstractThis paper gives the first polynomial time approximation scheme for the connected vertex cov...
Given a set P of n points in the plane, we consider the problem of covering P with a minimum number ...
The following planar minimum disk cover problem is considered in this paper: given a set D of n disk...
Numerous approximation algorithms for unit disk graphs have been proposed in the literature, exhibit...
We present a basic theorem in combinatorial geometry that leads to a family of approximation algorit...
Abstract. Given a set P of n points and a set D of m unit disks on a 2-dimensional plane, the discre...
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...
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...
We investigate the Within-Strip Discrete Unit Disk Cover problem (WSDUDC), where one wishes to find ...
We give an improved approximation algorithm for the unique unit-disk coverage problem: Given a set o...
International audienceNumerous approximation algorithms for problems on unit disk graphs have been p...
We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which is a restric...
Given a set D of m unit disks and a set P of n points in the plane, the discrete unit disk cover pro...
AbstractThis paper gives the first polynomial time approximation scheme for the connected vertex cov...