Pages that link to "Item:Q2456357"
From MaRDI portal
The following pages link to On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357):
Displaying 28 items.
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- The MST of symmetric disk graphs is light (Q425622) (← links)
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← 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)
- Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm (Q1701611) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← 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)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs (Q3558921) (← links)
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs (Q3638887) (← links)
- A matheuristic approach for solving the 2-connected dominating set problem (Q4989008) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
