Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs

Author(s):  
Andreas Wiese ◽  
Evangelos Kranakis
2017 ◽  
Vol 104 ◽  
pp. 159-166 ◽  
Author(s):  
Ramesh K. Jallu ◽  
Prajwal R. Prasad ◽  
Gautam K. Das

2017 ◽  
Vol 25 (1) ◽  
pp. 18-28 ◽  
Author(s):  
Wei Wang ◽  
Bei Liu ◽  
Donghyun Kim ◽  
Deying Li ◽  
Jingyi Wang ◽  
...  

2010 ◽  
Vol 02 (01) ◽  
pp. 99-105 ◽  
Author(s):  
WEIPING SHANG ◽  
XIUMEI WANG ◽  
XIAODONG HU

Unit disk graphs are the intersection graphs of equal sized disks in the plane, they are widely used as a mathematical model for wireless ad-hoc networks and some problems in computational geometry. In this paper we first show that Roman dominating set and connected Roman dominating set problems in unit disk graphs are NP-complete, and then present two approximation algorithms for these problems.


Algorithms ◽  
2008 ◽  
Vol 1 (1) ◽  
pp. 2-29 ◽  
Author(s):  
Andreas Wiese ◽  
Evangelos Kranakis

Sign in / Sign up

Export Citation Format

Share Document