Algorithms for Minimum m-Connected k-Dominating Set Problem

DOI10.1007/978-3-540-73556-4_21zbMath1175.05104OpenAlexW2099903496MaRDI QIDQ3611970

Peng-Jun Wan, Xiao-Dong Hu, Wei-Ping Shang, Frances F. Yao

Publication date: 3 March 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73556-4_21

zbMATH Keywords

approximation algorithmconnected dominating setwireless sensor networks\(k\)-vertex connectivity

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (1)

On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks

This page was built for publication: Algorithms for Minimum m-Connected k-Dominating Set Problem