The Maximum Distance-d Independent Set Problem on Unit Disk Graphs

Author(s):  
Sangram K. Jena ◽  
Ramesh K. Jallu ◽  
Gautam K. Das ◽  
Subhas C. Nandy
2020 ◽  
Vol 280 ◽  
pp. 63-70 ◽  
Author(s):  
Gautam K. Das ◽  
Guilherme D. da Fonseca ◽  
Ramesh K. Jallu

2017 ◽  
Vol 27 (04) ◽  
pp. 255-276 ◽  
Author(s):  
Guilherme D. da Fonseca ◽  
Vinícius Gusmão Pereira de Sá ◽  
Celina Miraglia Herrera de Figueiredo

Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy that allows us to obtain linear-time constant-factor approximation algorithms for such problems. To illustrate the applicability of the proposed variation, we obtain results for three well-known optimization problems. Among such results, the proposed method yields linear-time [Formula: see text]-approximations for the maximum-weight independent set and the minimum dominating set of unit disk graphs, thus bringing significant performance improvements when compared to previous algorithms that achieve the same approximation ratios. Finally, we use axis-aligned rectangles to illustrate that the same method may be used to derive linear-time approximations for problems on other geometric intersection graph classes.


2021 ◽  
pp. 101808
Author(s):  
Adrian Dumitrescu ◽  
Anirban Ghosh ◽  
Csaba D. Tóth
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document