A simple greedy approximation algorithm for the unit disk cover problem
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 prob...
| Published in: | AUT Journal of Mathematics and Computing |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2020-02-01
|
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_3044_69fd7125903ed84f45ff4a2b2a419779.pdf |
| Summary: | 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. |
|---|---|
| ISSN: | 2783-2449 2783-2287 |