Two algorithms for minimum 2-connected r-hop dominating set

Authors:
Xiuying Li;Zhao Zhang
Affiliations:
College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, PR China;College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, PR China
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 1

Unit disk graphs

Discrete Mathematics - Topics on domination
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
Algorithms for minimum m-connected k-tuple dominating set problem

Theoretical Computer Science
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Graph Theory

Graph Theory
On the construction of 2-connected virtual backbone in wireless networks

IEEE Transactions on Wireless Communications

A constant-factor approximation for d-hop connected dominating sets in unit disk graph

International Journal of Sensor Networks

Quantified Score

Hi-index	0.89

Visualization

Abstract

For a graph G=(V,E), a subset D@?V is an r-hop dominating set if every vertex u@?V-D is at most r-hops away from D. It is a 2-connected r-hop dominating set if the subgraph of G induced by D is 2-connected. In this paper, we present two approximation algorithms to compute minimum 2-connected r-hop dominating set. The first one is a greedy algorithm using ear decomposition of 2-connected graphs. This algorithm is applicable to any 2-connected general graph. The second one is a three-phase algorithm which is only applicable to unit disk graphs. For both algorithms, performance ratios are given.