Rule k is a localized approximation algorithm that finds a small connected dominating set in a graph. We estimate the expected size of the Rule k dominating set for the model of random unit disk graphs constructed from n random points in an s_n by s_n square region of the plane.
@article{arxiv.cs/0408067,
title = {The Expected Size of the Rule k Dominating Set},
author = {Jennie C. Hansen and Eric Schmutz},
journal= {arXiv preprint arXiv:cs/0408067},
year = {2007}
}