Pages that link to "Item:Q706637"
From MaRDI portal
The following pages link to A greedy approximation for minimum connected dominating sets (Q706637):
Displaying 31 items.
- 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)
- 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)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- New dominating sets in social networks (Q604953) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Connected Domination (Q3384607) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- Some results for the two disjoint connected dominating sets problem (Q5207499) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
