%0 Journal Article %T A simple greedy approximation algorithm for the unit disk cover problem %J AUT Journal of Mathematics and Computing %I Amirkabir University of Technology %Z 2783-2449 %A Imanparast, Mahdi %A Hashemi, Seyed Naser %D 2020 %\ 02/01/2020 %V 1 %N 1 %P 47-55 %! A simple greedy approximation algorithm for the unit disk cover problem %K computational geometry %K approximation algorithms %K unit disk cover problem %K facility location %R 10.22060/ajmc.2018.3044 %X Given a set $\mathcal P$ of $n$ points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of $\mathcal P$. We present a new $4$-approximation algorithm with running time $O(n \log n)$ for this problem. Our proposed algorithm uses a simple approach and is easy to understand and implement. %U https://ajmc.aut.ac.ir/article_3044_69fd7125903ed84f45ff4a2b2a419779.pdf