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

• Type: Journal
• Year: 2006
• Where: ALGORITHMICA
• Authors: Jennie C. Hansen, Eric Schmutz, Li Sheng
• Keywords: ALGORITHMICA 2006, Approximation Algorithm, Dominating Set, Unit Disk Graph