Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

ALGORITHMICA
2006

favoriteEmaildiscussreport

161views more ALGORITHMICA 2006»

The Expected Size of the Rule k Dominating Set

13 years 4 months ago

The Expected Size of the Rule k Dominating Set

Download www.math.drexel.edu

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

Real-time Traffic

ALGORITHMICA 2006 | Approximation Algorithm | Dominating Set | Unit Disk Graph |

claim paper

Related Content

» Linear kernels for connected dominating set on Hminorfree graphs

» Incremental Construction of kDominating Sets in Wireless Sensor Networks

» Distributed Connected Dominating Set Construction in Geometric kDisk Graphs

» On minimum m connected k dominating set problem in unit disc graphs

» Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks

» Coloring Sparse Random kColorable Graphs in Polynomial Expected Time

» Dominating sets in kmajority tournaments

» Polynomial Time Data Reduction for Dominating Set

» Dominant Graph An Efficient Indexing Structure to Answer TopK Queries

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ALGORITHMICA
Authors	Jennie C. Hansen, Eric Schmutz, Li Sheng

Comments (0)