Pages that link to "Item:Q3652256"
From MaRDI portal
The following pages link to Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks (Q3652256):
Displaying 11 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)
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs (Q887860) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
- Some results for the two disjoint connected dominating sets problem (Q5207499) (← links)
- (Q5240127) (← links)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
- A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)