Back to Search
Start Over
Faster Approximation for Maximum Independent Set on Unit Disk Graph
- Publication Year :
- 2016
-
Abstract
- Maximum independent set from a given set $D$ of unit disks intersecting a horizontal line can be solved in $O(n^2)$ time and $O(n^2)$ space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of $O(n^2)$. The best known factor 2 approximation algorithm for this problem runs in $O(n^2 \log n)$ time and takes $O(n^2)$ space [Jallu and Das 2016, Das et al. 2016].
- Subjects :
- Computer Science - Computational Geometry
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1611.03260
- Document Type :
- Working Paper