The maximum distance-d independent set problem on unit disk graphs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
In this article, we study the maximum distance-d independent set problem, a variant of the maximum independent set problem, on unit disk graphs. We first show that the problem is NP-hard. Next, we propose a polynomial-time constant-factor approximation algorithm and a PTAS for the problem.
Jena, Sangram K.; Jallu, Ramesh K.; Das, Gautam K.; and Nandy, Subhas C., "The maximum distance-d independent set problem on unit disk graphs" (2018). Conference Articles. 155.