Sciweavers

Share
ALGORITHMICA
2006

The Expected Size of the Rule k Dominating Set

10 years 2 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average case"performance of two closely related versions of Rule k for the model of random unit disk graphs constructed from n random points in an n
Jennie C. Hansen, Eric Schmutz, Li Sheng
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where ALGORITHMICA
Authors Jennie C. Hansen, Eric Schmutz, Li Sheng
Comments (0)
books