Pages that link to "Item:Q5874545"
From MaRDI portal
The following pages link to Approximating k-Connected m-Dominating Sets (Q5874545):
Displaying 10 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)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- (Q4472438) (← links)
- Approximation algorithms for connected dominating sets (Q4595486) (← links)
- (Q4680214) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
