Pages that link to "Item:Q1799605"
From MaRDI portal
The following pages link to Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605):
Displaying 10 items.
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Approximation algorithms for connected dominating sets (Q4595486) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem (Q6645156) (← links)
