The Generalized Independent and Dominating Set Problems on Unit Disk Graphs
Data Structures and Algorithms
2020-06-30 v1 Computational Complexity
Abstract
In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum -distance independent set problem and the minimum -distance dominating set problem on unit disk graphs for a positive integer . We first show that the maximum -distance independent set problem and the minimum -distance dominating set problem belongs to NP-hard class. Next, we propose a simple polynomial-time constant-factor approximation algorithms and PTAS for both the problems.
Keywords
Cite
@article{arxiv.2006.15381,
title = {The Generalized Independent and Dominating Set Problems on Unit Disk Graphs},
author = {Sangram K. Jena and Ramesh K. Jallu and Gautam K. Das and Subhas C. Nandy},
journal= {arXiv preprint arXiv:2006.15381},
year = {2020}
}