Probabilistic Analysis of Rule 2
Abstract
Li and Wu proposed Rule 2, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. Here we study the asymptotic performance of Rule 2 on random unit disk graphs formed from n random points in an sn by sn square region of the plane. If sn is below the threshold for connectivity, then Rule 2 produces a dominating set whose expected size is O(n/(loglog n)3/2). We conjecture that this bound is not optimal.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.