(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs

2008 ◽  
pp. 551-557 ◽  
Author(s):  
Xiaofeng Gao ◽  
Yaochun Huang ◽  
Zhao Zhang ◽  
Weili Wu
Keyword(s):  
Unit Disk ◽  
Dominating Set ◽  
Minimum Weight ◽  
Unit Disk Graphs

ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS

2010 ◽  
Vol 02 (01) ◽  
pp. 99-105 ◽  
Author(s):  
WEIPING SHANG ◽  
XIUMEI WANG ◽  
XIAODONG HU
Keyword(s):  
Mathematical Model ◽  
Unit Disk ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Dominating Set ◽  
Roman Domination ◽  
Intersection Graphs ◽  
Unit Disk Graphs ◽  
Np Complete ◽  
Hoc Networks

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.

scholarly journals A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs

2015 ◽  
Vol 571 ◽  
pp. 58-66 ◽  
Author(s):  
Limin Wang ◽  
Xiaoyan Zhang ◽  
Zhao Zhang ◽  
Hajo Broersma
Keyword(s):  
Unit Disk ◽  
Minimum Weight ◽  
Vertex Cover ◽  
Unit Disk Graphs ◽  
Connected Vertex Cover ◽  
Connected Vertex

scholarly journals Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs

2017 ◽  
Vol 25 (2) ◽  
pp. 925-933 ◽  
Author(s):  
Yishuo Shi ◽  
Zhao Zhang ◽  
Yuchang Mo ◽  
Ding-Zhu Du
Keyword(s):  
Approximation Algorithm ◽  
Unit Disk ◽  
Fault Tolerant ◽  
Minimum Weight ◽  
Virtual Backbone ◽  
Unit Disk Graphs
Sign in / Sign up

Export Citation Format

Share Document