The Expected Size of the Rule k Dominating Set
Jennie C. Hansen, Eric Schmutz
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 sn by sn square region of the plane.
Create a lesson
Related papers
Equitable Subpartitionability Does Not Characterize Box-TDI Polyhedra
Emiliano Lancini, Francesco Pisanu
Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition
Quanlong Niu, Riheng Jia
Maximal Linear Arrangement is NP complete on Bipartite Graphs
Aparna Das, Jonathan Needleman
Counting Polyominoes, Revisited: Corrigendum and Addendum
Gill Barequet, Gil Ben-Shachar
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S et al.
An upper bound of 4.268 for the random 3-SAT satisfiability threshold
Fedor Vorobyev