Randomized greedy algorithms for finding small k-dominating sets of regular graphs

Authors:
W. Duckworth;B. Mans
Affiliations:
Department of Computing, Macquarie University, Sydney, NSW, Australia;Department of Computing, Macquarie University, Sydney, NSW, Australia
Venue:
Random Structures & Algorithms
Year:
2005

Citing 5
Cited 0

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Minimum independent dominating sets of random cubic graphs

Random Structures & Algorithms
Small k-Dominating Sets of Regular Graphs

RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
On the Independent Domination Number of Random Regular Graphs

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A k-dominating set of a graph G is a subset D of the vertices of G such that every vertex of G is either in D or at distance at most k from a vertex in D. It is of interest to find k- dominating sets of small cardinality. In this paper we consider simple randomized greedy algorithms for finding small k-dominating sets of regular graphs. We analyze the average-case performance of the most efficient of these simple heuristics showing that it performs surprisingly well on average. The analysis is performed on random regular graphs using differential equations. This, in turn, proves upper bounds on the size of a minimum k-dominating set of random regular graphs.