The Expected Size of the Rule k Dominating Set

Simple item page
dc.creatorHansen, Jennie C.
dc.creatorSchmutz, Eric
dc.date2004-08-31
dc.date.accessioned2026-07-07T03:21:44Z
dc.date.available2026-07-07T03:21:44Z
dc.descriptionRule 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.
dc.identifierhttps://arxiv.org/abs/cs/0408067
dc.identifierhttp://arxiv.org/abs/cs/0408067
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32315
dc.subjectDiscrete Mathematics
dc.titleThe Expected Size of the Rule k Dominating Set
dc.typetext

Files

Collections

arXiv