Apr 1, 2021 · Our proposed algorithms approximate the number of colors used in the coloring if there exists a k-colorable cover.
Sep 9, 2021 · We consider the k-Colorable Discrete Unit Disk Cover (k-CDUDC) problem as follows. Given a parameter k, a set P of n points, and a set D of m unit disks.
People also ask
What is the unit disk covering problem?
Apr 12, 2021 · In this article, we consider colorable variations of the Unit Disk Cover (UDC) problem as follows. k-Colorable Discrete Unit Disk Cover (k-CDUDC) ...
Sep 13, 2024 · Our proposed algorithms approximate the number of colors used in the coloring if there exists a $k$-colorable cover.
For the k-CDUDC problem, our proposed algorithms approximate the number of colors used in the coloring if there exists a k-colorable cover. We first propose a 4 ...
We investigate the problem of locally coloring and constructing special spanners of location aware Unit Disk Graphs (UDGs). First we present a local ...
The discrete unit disk cover (DUDC) problem is (i) to check whether each point in is covered by at least one disk in or not and (ii) if so, then find a minimum ...
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.
The k-improper chromatic number χk(G) is the least l such that G is k-improperly l-colourable. A unit disk graph is the intersection graph of equal-sized disks ...
Apr 25, 2017 · We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which is a restricted version of the Discrete Unit Disk Cover (DUDC) problem.