An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem

Authors:
Bin Fu;Zhixiang Chen;Mahdi Abdelguerfi
Affiliations:
Dept. of Computer Science, University of Texas - Pan American, TX 78539, USA;Dept. of Computer Science, University of Texas - Pan American, TX 78539, USA;Dept. of Computer Science, University of New Orleans, LA 70148, USA
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 6
Cited 0

A study on two geometric location problems

Information Processing Letters
Optimal algorithms for approximate clustering

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Faster construction of planar two-centers

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
More planar two-center algorithms

Computational Geometry: Theory and Applications
A Geometric Theorem for Network Design

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(logn)2(loglogn)2) deterministic time 2.8334-approximation algorithm for this problem. Previous approximation algorithms [7,3,6], when used to achieve the same approximation ratio for the disc covering problem, will have much higher time complexity than our algorithms.