Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set

by   Chaojie Zhu, et al.

A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum connected dominating set problem (MinCDS), whose performance is theoretically guaranteed in terms of both computation time and approximation ratio. Given a connected graph G=(V,E), a connected dominating set (CDS) is a subset C⊆ V such that every vertex in V∖ C has a neighbor in C, and the subgraph of G induced by C is connected. The goal of MinCDS is to find a CDS of G with the minimum cardinality. We show that our evolutionary algorithm can find a CDS in expected O(n^3) time which approximates the optimal value within factor (2+lnΔ), where n and Δ are the number of vertices and the maximum degree of graph G, respectively.


page 1

page 2

page 3

page 4


Connected domination in grid graphs

Given an undirected simple graph, a subset of the vertices of the graph ...

An Õ(log^2 n)-approximation algorithm for 2-edge-connected dominating set

In the Connected Dominating Set problem we are given a graph G=(V,E) and...

Dominating Sets and Connected Dominating Sets in Dynamic Graphs

In this paper we study the dynamic versions of two basic graph problems:...

Approximating k-connected m-dominating sets

A subset S of nodes in a graph G is a k-connected m-dominating set ((k,m...

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs

The problem of finding a minimum-weight connected dominating set (CDS) o...

Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem

In metric search, worst-case analysis is of little value, as the search ...

Approximating Optimization Problems using EAs on Scale-Free Networks

It has been experimentally observed that real-world networks follow cert...