scholarly journals Approximation Algorithms for Unit Disk Graphs

2005 ◽  
pp. 351-361 ◽  
Author(s):  
Erik Jan van Leeuwen
Keyword(s):  
Approximation Algorithms ◽  
Unit Disk ◽  
Unit Disk Graphs

scholarly journals Linear-Time Approximation Algorithms for Unit Disk Graphs

2015 ◽  
pp. 132-143 ◽  
Author(s):  
Guilherme D. da Fonseca ◽  
Vinícius G. Pereira de Sá ◽  
Celina M. H. de Figueiredo
Keyword(s):  
Approximation Algorithms ◽  
Unit Disk ◽  
Linear Time ◽  
Time Approximation ◽  
Unit Disk Graphs

Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes

2009 ◽  
Vol 4 (3) ◽  
pp. 311-320 ◽  
Author(s):  
Balabhaskar Balasundaram ◽  
Shyam Sundar Chandramouli ◽  
Svyatoslav Trukhanov
Keyword(s):  
Approximation Algorithms ◽  
Unit Disk ◽  
Unit Disk Graphs

scholarly journals Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs

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
Keyword(s):  
Approximation Algorithms ◽  
Unit Disk ◽  
Optimization Problems ◽  
Linear Time ◽  
Dominating Set ◽  
Independent Set ◽  
Constant Factor ◽  
Intersection Graphs ◽  
Unit Disk Graphs ◽  
Graph Classes

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.

scholarly journals Sparse hop spanners for unit disk graphs

2021 ◽  
pp. 101808
Author(s):  
Adrian Dumitrescu ◽  
Anirban Ghosh ◽  
Csaba D. Tóth
Keyword(s):  
Unit Disk ◽  
Unit Disk Graphs
Sign in / Sign up

Export Citation Format

Share Document