Pages that link to "Item:Q324721"
From MaRDI portal
The following pages link to The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721):
Displaying 6 items.
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets (Q2942693) (← links)
- (Q5136270) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- The parameterized complexity of terminal monitoring set (Q6575382) (← links)