Sciweavers

Share
AAIM
2007
Springer

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

9 years 1 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
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(log n)2 (log log n)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.
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
Added 06 Jun 2010
Updated 06 Jun 2010
Type Conference
Year 2007
Where AAIM
Authors Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
Comments (0)
books