Pages that link to "Item:Q3634205"
From MaRDI portal
The following pages link to ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205):
Displaying 18 items.
- Improved linear problem kernel for planar connected dominating set (Q392013) (← 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)
- A decidability result for the dominating set problem (Q410736) (← links)
- New dominating sets in social networks (Q604953) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs (Q887860) (← links)
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks (Q896118) (← links)
- Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- (Q3104317) (← links)
- (Q3374248) (← links)
- (Q4680214) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- (Q5240127) (← links)
- A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
