Pages that link to "Item:Q828691"
From MaRDI portal
The following pages link to Greedy approximation for the minimum connected dominating set with labeling (Q828691):
Displaying 5 items.
- Minimum connected dominating sets in finite graphs (Q712285) (← links)
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique (Q3507758) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← links)