The Expected Size of the Rule k Dominating Set
classification
💻 cs.DM
keywords
dominatingruleexpectedrandomsizealgorithmapproximationconnected
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.