Abstract
In a graph G = (V, E), a subset C of vertices is called a Connected Dominating Set if every vertex is either in C or adjacent to a vertex in C, and in addition the subgraph induced by C is connected. Given a graph, finding the minimum Connected Dominating Set is a classical combinatorial optimization problem, existing in literature for a long time. Due to wide applications of the minimum Connected Dominating Set in wireless networks, Connected Dominating Sets attract many recent research efforts. In this chapter, those developments are surveyed.
Cite
CITATION STYLE
Du, H., Ding, L., Wu, W., Kim, D., Pardalos, P. M., & Willson, J. (2013). Connected dominating set in wireless networks. In Handbook of Combinatorial Optimization (Vol. 2–5, pp. 783–833). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
