An Optimal Algorithm for the Minimum Disc Cover Problem

Authors:
Min-Te Sun;Chih-Wei Yi;Chuan-Kai Yang;Ten-Hwang Lai
Affiliations:
Auburn University, Department of Computer Science and Software Engineering, 36849, Auburn, AL, USA;National Chiao Tung University, Department of Computer Science, 30010, Hsinchu City, AL, Taiwan;National Taiwan University of Science and Technology, Department of Information Management, 106, Taipei, AL, Taiwan;Ohio State University, Department of Computer Science and Engineering, 43210, Columbus, OH, USA
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 2

Polynomial time approximation schemes for minimum disk cover problems

Journal of Combinatorial Optimization
Evolutionary algorithm for optimal anchor node placement to localize devices in a mobile ad hoc network during building evacuation

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum disc cover can be used to construct a dominating set on the fly for energy-efficient communications in mobile ad hoc networks, but the approach used to compute the minimum disc cover proposed in previous studies is computationally relatively expensive. In this paper, we show that the disc cover problem is in fact a special case of the general α-hull problem. In spite of being a special case, the disc cover problem is not easier than the general α-hull problem. 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 constructs the minimum disc cover for arbitrary cases, including those degenerate cases where the α-hull approach would fail.