In this paper we consider the discrete unit disk cover problem and the rectangular region cover problem as follows:
If the disk centers are constrained to an arbitrary point set Q, the UDC problem becomes the discrete unit disk cover problem (DUDC), which is also NP-hard.
In this paper we consider the discrete unit disk cover problem and the rectangular region cover problem as follows. Given a set of points and a set of unit ...
People also ask
What is the unit disk covering problem?
What is the set covering problem?
Feb 12, 2016 · Abstract. Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks.
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.
Unit Disk Cover Problem in 2D. Gautam K. Das. Department of Mathematics. Indian Institute of Technology Guwahati ... Unit Disk Cover Problem in 2D. 28 / 28.
Aug 29, 2019 · There is a paper that provides a constant approximation algorithm (Basappa et al, "Unit disk cover problem in 2D") but no proof of NP ...
Approximation Algorithms for the Unit Disk Cover Problem in 2D and 3D.
Sep 13, 2012 · The solution of DUDC problem is based on a PTAS for the subproblem LSDUDC, where all the points in {\cal P} are on one side of a line and ...
Missing: 2D. | Show results with:2D.
The discrete unit disk cover problem is a geometric version of the general set cover problem which is NP-hard. The general set cover problem is not approximable ...