Pages that link to "Item:Q2144267"
From MaRDI portal
The following pages link to Approximating \(k\)-connected \(m\)-dominating sets (Q2144267):
Displaying 7 items.
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- (Q4472438) (← links)
- Approximation algorithms for connected dominating sets (Q4595486) (← links)
- (Q4680214) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
