Approximation algorithms for connected dominating sets
From MaRDI portal
Recommendations
- Approximation algorithms for connected dominating sets
- Approximating k-Connected m-Dominating Sets
- Approximating \(k\)-connected \(m\)-dominating sets
- A greedy approximation for minimum connected dominating sets
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- Parameterized approximation of dominating set problems
- Approximation algorithms for domination search
- On the parameterized complexity of approximating dominating set
- On the Parameterized Complexity of Approximating Dominating Set
Cited in
(51)- Approximation algorithms for connected dominating sets
- An exact algorithm for the maximum leaf spanning tree problem.
- Algorithms for graphs with small octopus
- The probabilistic minimum dominating set problem
- Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
- Wireless networking, dominating and packing
- On approximation of dominating tree in wireless sensor networks
- Algorithmic aspects of secure connected domination in graphs
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Approximating \(k\)-connected \(m\)-dominating sets
- Leafy spanning \(k\)-forests
- A polynomial-time approximation to a minimum dominating set in a graph
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Dominating problems in swapped networks
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Algorithms for Steiner connected dominating set problem based on learning automata theory
- scientific article; zbMATH DE number 1302025 (Why is no real title available?)
- Connected dominating set. Theory and applications
- Algorithms for the minimum weight k-fold (connected) dominating set problem
- scientific article; zbMATH DE number 1163715 (Why is no real title available?)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- scientific article; zbMATH DE number 2080196 (Why is no real title available?)
- The maximum-leaf spanning tree problem: Formulations and facets
- Complexity and approximation of the connected set-cover problem
- Revisiting connected dominating sets: an optimal local algorithm?
- scientific article; zbMATH DE number 2172821 (Why is no real title available?)
- The probabilistic min dominating set problem
- A matheuristic approach for solving the 2-connected dominating set problem
- Near-optimal distributed approximation of minimum-weight connected dominating set
- Dominating an s-t-cut in a network
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- On the Parameterized Complexity of Approximating Dominating Set
- Connected dominating set in hypergraph
- On connected domination in unit ball graphs
- Solving Connected Dominating Set Faster Than 2 n
- Computing and Combinatorics
- Approximation Algorithms and Hardness for Domination with Propagation
- Approximation algorithm for (connected) Italian dominating function
- A unified greedy approximation for several dominating set problems
- A greedy approximation for minimum connected dominating sets
- Minimum connected dominating sets in finite graphs
- Greedy approximation for the minimum connected dominating set with labeling
- Solving connected dominating set faster than \(2^n\)
- Approximation hardness of dominating set problems in bounded degree graphs
This page was built for publication: Approximation algorithms for connected dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595486)
