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

DOI10.1007/s10878-010-9346-2zbMath1245.90106OpenAlexW1988374520MaRDI QIDQ434202

Chunyu Ai, Raheem Beyah, Yiwei Wu, Yingshu Li

Publication date: 10 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9346-2

zbMATH Keywords

approximation algorithmsdistributed algorithmswireless networksperformance ratioconnected dominating sets\(k\)-connected \(m\)-dominating sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (7)

A greedy algorithm for the fault-tolerant connected dominating set in a general graph ⋮ Construction of minimum edge-fault tolerant connected dominating set in a general graph ⋮ Partial domination - the isolation number of a graph ⋮ A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem ⋮ An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube ⋮ A matheuristic approach for solving the 2-connected dominating set problem ⋮ Tractable connected domination for restricted bipartite graphs

Cites Work

• Approximation algorithms for connected dominating sets
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• Algorithms for Minimum m-Connected k-Dominating Set Problem

This page was built for publication: On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks