Nov 10, 2007 · The minimum disc cover can be used to construct a dominating set on the fly for energy-efficient communications in mobile ad hoc networks, ...
In addition to the known α-hull approach, we provide an optimal divide-and-conquer algorithm that constructs the minimum disc cover set for arbitrary cases, ...
This paper shows that the disc cover problem is in fact a special case of the general α-hull problem, and presents a simple, yet optimal divide-and-conquer ...
In addition to applying the existing α-hull algorithm to solve the disc cover problem, we present a simple, yet optimal divide-and-conquer algorithm that ...
People also ask
What is the most optimal disk scheduling algorithm?
What is the minimum geometric disk cover problem?
What is greedy algorithm for maximum coverage problem?
Mar 19, 2019 · Start with a hierarchical clustering solution to the problem. · You could probably then use gradient descent to move the centers of the disks ( ...
An Optimal Algorithm for the Minimum Disc Cover Problem by Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai published in Algorithmica.
Fingerprint. Dive into the research topics of 'An optimal algorithm for the minimum disc cover problem'. Together they form a unique fingerprint.
Many approximation algorithms are proposed for the DUDC problem, where the best known approximation factor is 9 + ϵ for any 0 < ϵ ≤ 6 [2]. An instance of the ...
Gonzalez proposed an 8-approximation algorithm for the fixed-size disks covering problem in [9]. Huang devised a 7-approximation algorithm for the 2-dimension.
This work presents the first polynomial time approxi- mation scheme for the minimum disk cover problem where the best known algorithm can approximate the ...