25 citations · 28 across the 4 of their papers we have counts for
4 papers
A New Approximation Algorithm for Minimum-Weight --Connected Dominating Set
Jiao Zhou, Yingli Ran, Panos M. Pardalos +3
Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset…
Performance Guaranteed Approximation Algorithm for Minimum -Connected -Fold Dominating Set
Zhao Zhang, Jiao Zhou, Xiaohui Huang +1
To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a $(k,…
Approximation Algorithm for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks
Jiao Zhou, Zhao Zhang, Xiaohui Huang +1
To save energy and alleviate interferences in a wireless sensor network, the usage of virtual backbone was proposed. Because of accidental damages or energy depletion, it is desira…
Approximation Algorithm for Minimum Weight Connected -Fold Dominating Set
Zhao Zhang, Jiao Zhou, Ker-I Ko +1
Using connected dominating set (CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. Since nodes may fail due to accidental damage or…