An Improved Approximation Factor For The Unit Disk Covering Problem
Sada Narayanappa, Petr Vojtěchovský · Canadian Conference on Computational Geometry · 2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on the method used. This is an improvement on the best known approximation factor of 108.