Amirkabir University of TechnologyAUT Journal of Mathematics and Computing2783-24491120200201A simple greedy approximation algorithm for the unit disk cover problem4755304410.22060/ajmc.2018.3044ENMahdiImanparastDepartment of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, IranSeyed NaserHashemiDepartment of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, IranJournal Article20180424Given 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.https://ajmc.aut.ac.ir/article_3044_69fd7125903ed84f45ff4a2b2a419779.pdf