A greedy algorithm for the minimum 2-connected m-fold dominating set problem
DOI10.1007/S10878-014-9720-6zbMATH Open1341.90118OpenAlexW2043377742MaRDI QIDQ5963614FDOQ5963614
Authors: Yishuo Shi, Yaping Zhang, Zhao Zhang, Weili Wu 
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9720-6
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Approximation algorithms for connected dominating sets
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Title not available (Why is that?)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- A greedy approximation for minimum connected dominating sets
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
- Approximating Steiner networks with node-weights
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
- Design and analysis of approximation algorithms
Cited In (14)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
- Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
- Optimal channel assignment with list-edge coloring
- On approximating (connected) 2-edge dominating set by a tree
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
- Further results on the total monochromatic connectivity of graphs
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Construction of minimum edge-fault tolerant connected dominating set in a general graph
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)
