We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth ...
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth ...
Abstract. We present the first polynomial-time approximation scheme (PTAS) for the Mini- mum Independent Dominating Set problem in graphs of polynomially ...
A linear time approximation algorithm is introduced that takes the usual adjacency representation of the graph as input and attains a 44/9 approximation ...
Bibliographic details on Approximating minimum independent dominating sets in wireless networks.
People also ask
What is the minimum independent dominating set?
How do you find the minimum dominating set?
What is the approximation of a dominating set?
What is the minimum dominating set MDS?
Approximating minimum independent dominating sets in wireless networks. Information Processing Letters, 109(2):155–160, 2008. 12. M. V. Marathe, H. Breu ...
More specifically, the greedy algorithm provides a factor 1 + log|V| approximation of a minimum dominating set, and no polynomial time algorithm can achieve an ...
A Connected Dominating Set (CDS) of a graph rep- resenting a Wireless Sensor Network can be used as a virtual backbone for routing through the network.
A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks: Research Articles. Authors: Bo Gao.
Abstract. In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many.