An Improved Approximation Factor For The Unit Disk Covering Problem

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.

• Type: Conference
• Year: 2006
• Where: CCCG
• Authors: Sada Narayanappa, Petr Vojtechovský
• Keywords: Approximation Factor, CCCG 2006, CCCG 2007, Polynomial Time Algorithm, Possible Approximation Factor