Pages that link to "Item:Q3175482"
From MaRDI portal
The following pages link to A decomposition approach for the minimum connected dominating set problem (Q3175482):
Displaying 8 items.
- Connected dominating set. Theory and applications (Q436191) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- Restricted swap-based neighborhood search for the minimum connected dominating set problem (Q4565786) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)