A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition

@article{Wang2015ABC,
  title={A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition},
  author={Wei Wang and Bei Liu and Donghyun Kim and Deying Li and Jingyi Wang and Yaolin Jiang},
  journal={2015 IEEE Conference on Computer Communications (INFOCOM)},
  year={2015},
  pages={1796-1804}
}
Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. One popular way to construct a quality virtual backbone is to solve the minimum connected dominating set problem. However, a virtual backbone computed in this way is not resilient against topology change since the induced graph by the connected dominating set is one-vertex-connected. As a result, the minimum k-connected m-dominating set problem… CONTINUE READING
10 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

and W

  • D. Kim, W. Wang, X. Li, Z. Zhang
  • Wu, “A New Constant Factor Approximation for…
  • 2010
Highly Influential
5 Excerpts

Connectivity in graphs

  • W. T. Tutte
  • Oxford U.P
  • 1966
Highly Influential
3 Excerpts

and R

  • Y. Li, Y. Wu, C. Ai
  • Beyah, “On the Construction of k-connected m…
  • 2012
1 Excerpt

W

  • N. Zhang, I. Shin, F. Zou
  • Wu, and M.T. Thai, “Trade-off Scheme for Fault…
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…