Algorithms for Minimum m-Connected k-Dominating Set Problem

DOI10.1007/978-3-540-73556-4_21MaRDI QIDQ3611970zbMATH OpenOpenAlexFDO

Authors Peng-Jun Wan, Xiaodong Hu, Weiping 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

\(k\)-vertex connectivityapproximation algorithmconnected dominating setwireless sensor networks

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
• Algorithms for minimum connected capacitated dominating set problem

Cited in

(24)

• On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
• A distributed approximation algorithm for the bottleneck connected dominating set problem
• On approximation of dominating tree in wireless sensor networks
• Routing-efficient CDS construction in disk-containment graphs
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Algorithms for minimum connected capacitated dominating set problem
• Load-balanced virtual backbone construction for wireless sensor networks
• Efficient algorithm for finding minimum connected dominating set in wireless sensor networks
• An Exact Algorithm for the Minimum Dominating Clique Problem
• Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
• Algorithms for the minimum weight k-fold (connected) dominating set problem
• Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
• The optimal design of low-latency virtual backbones
• Efficient distributed algorithms for topology control problem with shortest path constraints
• TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
• Distributed Computing – IWDC 2005
• A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
• 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 better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem

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

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