The Expected Size of the Rule k Dominating Set
<|reference_start|>The Expected Size of the Rule k Dominating Set: 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.<|reference_end|>
@article{hansen2004the,
    title={The Expected Size of the Rule k Dominating Set},
    author={Jennie C. Hansen, Eric Schmutz},
    journal={arXiv preprint arXiv:cs/0408067},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0408067},
    primaryClass={cs.DM}
}