Pages that link to "Item:Q995580"
From MaRDI portal
The following pages link to Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580):
Displaying 18 items.
- 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)
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039) (← links)
- Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q1045016) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks (Q2507113) (← links)
- Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
