Pages that link to "Item:Q1679503"
From MaRDI portal
The following pages link to The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503):
Displaying 5 items.
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)