The maximum distance-d independent set problem on unit disk graphs

Authors

Sangram K. Jena, Indian Institute of Technology Guwahati
Ramesh K. Jallu, Indian Statistical Institute, Kolkata
Gautam K. Das, Indian Institute of Technology Guwahati
Subhas C. Nandy, Indian Statistical Institute, Kolkata

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

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.

First Page

68

Last Page

80

DOI

10.1007/978-3-319-78455-7_6

Publication Date

1-1-2018

Recommended Citation

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.
https://digitalcommons.isical.ac.in/conf-articles/155