A greedy algorithm for the minimum 2-connected m-fold dominating set problem
From MaRDI portal
Publication:5963614
Recommendations
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- Construction of minimum edge-fault tolerant connected dominating set in a general graph
- Algorithms for Minimum m-Connected k-Dominating Set Problem
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
Cites work
- scientific article; zbMATH DE number 5764849 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- A greedy approximation for minimum connected dominating sets
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximating Steiner networks with node-weights
- Approximation algorithms for connected dominating sets
- Design and analysis of approximation algorithms
- Graph theory
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
- 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
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
Cited in
(18)- On approximating (connected) 2-edge dominating set by a tree
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- A matheuristic approach for solving the 2-connected dominating set problem
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
- Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- Construction of minimum edge-fault tolerant connected dominating set in a general graph
- Optimal channel assignment with list-edge coloring
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- On the power of lookahead in greedy scheme for finding a minimum CDS for unit disk graphs
- Further results on the total monochromatic connectivity of graphs
This page was built for publication: A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963614)
