To reduce routing cost and to improve road load balance, we study a problem of minimizing size of connected dominating set D under constraint that for any two nodes u and v, the routing cost through D is within a factor of α from the minimum, the cost of the shortest path between u and v. We show that for α ≥ 5, this problem in unit disk graphs has a polynomial-time approximation scheme, that is, for any ε > 0, there is a polynomial-time (1 + ε)-approximation. © 2010 Springer-Verlag.
CITATION STYLE
Du, H., Ye, Q., Zhong, J., Wang, Y., Lee, W., & Park, H. (2010). PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6508 LNCS, pp. 252–259). https://doi.org/10.1007/978-3-642-17458-2_21
Mendeley helps you to discover research relevant for your work.