Summary and Info
This paper presents a (10 + ε)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neighbor in this subset. Besides, the subgraph induced by this vertex subset is connected. Our algorithm is composed of two phases: the first phase computes a dominating set, which has approximation ratio 6 + ε (ε is an arbitrary positive number), while the second phase connects the dominating sets computed in the first phase, which has approximation ratio 4.
More About the Author
Huang Yanpei is a Chinese historical television series based on the life of Huang Yanpei, a prominent educator, industrialist and politician who was also one of the founders of the China Democratic League.
Review and Comments
Rate the Book
A better constant-factor approximation for weighted dominating set in unit disk graph 0 out of 5 stars based on 0 ratings.