Pages that link to "Item:Q1386346"
From MaRDI portal
The following pages link to Approximation algorithms for connected dominating sets (Q1386346):
Displaying 50 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks (Q393036) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- Computing an effective decision making group of a society using social network analysis (Q489699) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Completely independent spanning trees in some regular graphs (Q516807) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- On connected domination in unit ball graphs (Q537633) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks (Q635294) (← links)
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks (Q663430) (← links)
- Clustering the wireless ad hoc networks: a distributed learning automata approach (Q666084) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- Network verification via routing table queries (Q743125) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem (Q1007590) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks (Q1718194) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
