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

DOI10.1007/S10878-010-9346-2MaRDI QIDQ434202zbMATH OpenOpenAlexFDO

Authors Yingshu Li, Yiwei Wu, Chunyu Ai, Raheem Beyah

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 algorithmsconnected dominating setsperformance ratiowireless networks\(k\)-connected \(m\)-dominating sets

Mathematics Subject Classification ID

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

Recommendations

• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Algorithms for Minimum m-Connected k-Dominating Set Problem
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem

Cites work

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

Cited in

(20)

• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks
• Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
• Construction of strongly connected dominating sets in asymmetric multihop wireless networks
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
• A matheuristic approach for solving the 2-connected dominating set problem
• A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• Partial domination -- the isolation number of a graph
• An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• Approximating minimum independent dominating sets in wireless networks
• A distributed approximation algorithm for the bottleneck connected dominating set problem
• Routing-efficient CDS construction in disk-containment graphs
• Construction of minimum edge-fault tolerant connected dominating set in a general graph
• Efficient distributed algorithms for topology control problem with shortest path constraints
• Tractable connected domination for restricted bipartite 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434202)