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